FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2002912175> ?p ?o ?g. }

• W2002912175 endingPage "1142" @default.
• W2002912175 startingPage "1126" @default.
• W2002912175 abstract "We consider the following efficiently non-adaptive group problem. There is an unknown string x ∈ {0, 1}n with at most d ones in it. We are allowed to test any subset S ⊆ [n] of the indices. The answer to the test tells whether xi = 0 for all i ∈ S or not. The objective is to design as few tests as possible (say, t tests) such that x can be identified as fast as possible (say, poly(t)-time). Efficiently decodable non-adaptive group has applications in many areas, including data stream algorithms and data forensics.A non-adaptive group strategy can be represented by a t x n matrix, which is the stacking of all the characteristic vectors of the tests. It is well-known that if this matrix is d-disjunct, then any test outcome corresponds uniquely to an unknown input string. Furthermore, we know how to construct d-disjunct matrices with t = O(d2 log n) efficiently. However, these matrices so far only allow for a time of O(nt), which can be exponentially larger than poly(t) for relatively small values of d.This paper presents a randomness efficient construction of d-disjunct matrices with t = O(d2 log n) that can be decoded in time poly(d) · t log2t + O(t2). To the best of our knowledge, this is the first result that achieves an efficient decoding time and matches the best known O(d2 log n) bound on the number of tests. We also derandomize the construction, which results in a polynomial time deterministic construction of such matrices when d = O(log n / log log n).A crucial building block in our construction is the notion of (d, l)-list disjunct matrices, which represent the more general group testing problem whose goal is to output less than d + l positions in x, including all the (at most d) positions that have a one in them. List disjunct matrices turn out to be interesting objects in their own right and were also considered independently by [Cheraghchi, FCT 2009]. We present connections between list disjunct matrices, expanders, dispersers and disjunct matrices. List disjunct matrices have applications in constructing (d, l)-sparsity separator structures [Ganguly, ISAAC 2008] and in constructing tolerant testers for Reed-Solomon codes in the data stream model." @default.
• W2002912175 created "2016-06-24" @default.
• W2002912175 creator A5001041485 @default.
• W2002912175 creator A5062573204 @default.
• W2002912175 creator A5076056716 @default.
• W2002912175 date "2010-01-17" @default.
• W2002912175 modified "2023-09-28" @default.
• W2002912175 title "Efficiently decodable non-adaptive group testing" @default.
• W2002912175 cites W105861178 @default.
• W2002912175 cites W1490484828 @default.
• W2002912175 cites W1509908192 @default.
• W2002912175 cites W1515124366 @default.
• W2002912175 cites W1544735579 @default.
• W2002912175 cites W171939419 @default.
• W2002912175 cites W1772667815 @default.
• W2002912175 cites W1967680338 @default.
• W2002912175 cites W1968160142 @default.
• W2002912175 cites W1975680434 @default.
• W2002912175 cites W1976052006 @default.
• W2002912175 cites W1999164389 @default.
• W2002912175 cites W2012584108 @default.
• W2002912175 cites W2063181761 @default.
• W2002912175 cites W2069878969 @default.
• W2002912175 cites W2079278135 @default.
• W2002912175 cites W2105294563 @default.
• W2002912175 cites W2118420122 @default.
• W2002912175 cites W2126479983 @default.
• W2002912175 cites W2133589924 @default.
• W2002912175 cites W2167973519 @default.
• W2002912175 cites W2170003889 @default.
• W2002912175 cites W2170496663 @default.
• W2002912175 cites W2194772305 @default.
• W2002912175 cites W2303097896 @default.
• W2002912175 cites W2603506033 @default.
• W2002912175 cites W2610183793 @default.
• W2002912175 cites W2610867264 @default.
• W2002912175 cites W2611754984 @default.
• W2002912175 doi "https://doi.org/10.5555/1873601.1873692" @default.
• W2002912175 hasPublicationYear "2010" @default.
• W2002912175 type Work @default.
• W2002912175 sameAs 2002912175 @default.
• W2002912175 citedByCount "35" @default.
• W2002912175 countsByYear W20029121752012 @default.
• W2002912175 countsByYear W20029121752013 @default.
• W2002912175 countsByYear W20029121752014 @default.
• W2002912175 countsByYear W20029121752015 @default.
• W2002912175 countsByYear W20029121752016 @default.
• W2002912175 countsByYear W20029121752017 @default.
• W2002912175 countsByYear W20029121752018 @default.
• W2002912175 countsByYear W20029121752019 @default.
• W2002912175 countsByYear W20029121752020 @default.
• W2002912175 countsByYear W20029121752021 @default.
• W2002912175 crossrefType "proceedings-article" @default.
• W2002912175 hasAuthorship W2002912175A5001041485 @default.
• W2002912175 hasAuthorship W2002912175A5062573204 @default.
• W2002912175 hasAuthorship W2002912175A5076056716 @default.
• W2002912175 hasConcept C105795698 @default.
• W2002912175 hasConcept C106487976 @default.
• W2002912175 hasConcept C11413529 @default.
• W2002912175 hasConcept C114614502 @default.
• W2002912175 hasConcept C118615104 @default.
• W2002912175 hasConcept C121332964 @default.
• W2002912175 hasConcept C125112378 @default.
• W2002912175 hasConcept C134306372 @default.
• W2002912175 hasConcept C144024400 @default.
• W2002912175 hasConcept C149923435 @default.
• W2002912175 hasConcept C157486923 @default.
• W2002912175 hasConcept C159985019 @default.
• W2002912175 hasConcept C177580056 @default.
• W2002912175 hasConcept C192562407 @default.
• W2002912175 hasConcept C2781311116 @default.
• W2002912175 hasConcept C2781445333 @default.
• W2002912175 hasConcept C2908647359 @default.
• W2002912175 hasConcept C33923547 @default.
• W2002912175 hasConcept C37914503 @default.
• W2002912175 hasConcept C41008148 @default.
• W2002912175 hasConcept C62520636 @default.
• W2002912175 hasConcept C63553672 @default.
• W2002912175 hasConcept C77553402 @default.
• W2002912175 hasConcept C87007009 @default.
• W2002912175 hasConcept C88484641 @default.
• W2002912175 hasConceptScore W2002912175C105795698 @default.
• W2002912175 hasConceptScore W2002912175C106487976 @default.
• W2002912175 hasConceptScore W2002912175C11413529 @default.
• W2002912175 hasConceptScore W2002912175C114614502 @default.
• W2002912175 hasConceptScore W2002912175C118615104 @default.
• W2002912175 hasConceptScore W2002912175C121332964 @default.
• W2002912175 hasConceptScore W2002912175C125112378 @default.
• W2002912175 hasConceptScore W2002912175C134306372 @default.
• W2002912175 hasConceptScore W2002912175C144024400 @default.
• W2002912175 hasConceptScore W2002912175C149923435 @default.
• W2002912175 hasConceptScore W2002912175C157486923 @default.
• W2002912175 hasConceptScore W2002912175C159985019 @default.
• W2002912175 hasConceptScore W2002912175C177580056 @default.
• W2002912175 hasConceptScore W2002912175C192562407 @default.
• W2002912175 hasConceptScore W2002912175C2781311116 @default.
• W2002912175 hasConceptScore W2002912175C2781445333 @default.
• W2002912175 hasConceptScore W2002912175C2908647359 @default.

• next