Sciweavers

3368 search results - page 159 / 674
» The Complexity of Query Reliability
Sort
View
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 2 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
120
Voted
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
16 years 2 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
Zeev Dvir, Amir Shpilka
154
Voted
DELOS
2000
15 years 3 months ago
MARIAN Searching and Querying across Heterogeneous Federated Digital Libraries
: We explore the complex problem of providing searching services across interoperable heterogeneous federated digital library systems with rich structure and content. We discuss sy...
Marcos André Gonçalves, Robert K. Fr...
ECBS
2009
IEEE
164views Hardware» more  ECBS 2009»
15 years 9 months ago
Semantically Enhanced Containers for Concurrent Real-Time Systems
Future space missions, such as Mars Science Laboratory, are built upon computing platforms providing a high degree of autonomy and diverse functionality. The increased sophisticat...
Damian Dechev, Peter Pirkelbauer, Nicolas Rouquett...
BTW
2009
Springer
240views Database» more  BTW 2009»
15 years 3 months ago
Efficient Adaptive Retrieval and Mining in Large Multimedia Databases
Abstract: Multimedia databases are increasingly common in science, business, entertainment and many other applications. Their size and high dimensionality of features are major cha...
Ira Assent