Sciweavers

3652 search results - page 6 / 731
» A study of query length
Sort
View
ECCC
2011
188views ECommerce» more  ECCC 2011»
13 years 2 months ago
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
Anna Gál, Andrew Mills
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
14 years 8 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
HICSS
2007
IEEE
125views Biometrics» more  HICSS 2007»
14 years 2 months ago
The Length of the Product Generation Life Cycle as a Moderator of Innovation Strategy: A Comparative Cross-Industry Study of Ten
This paper aims at exploring the role of the product generation life cycle (PGLC) on differences in innovation strategy among industries in a crossindustry study of ten multinatio...
Frances T. J. M. Fortuin, S. W. F. Omta
VLDB
2007
ACM
107views Database» more  VLDB 2007»
14 years 7 months ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
Chen Li, Bin Wang, Xiaochun Yang