Sciweavers

2797 search results - page 25 / 560
» Code query by example
Sort
View
CLEF
2009
Springer
15 years 24 days ago
Prior Art Search Using International Patent Classification Codes and All-Claims-Queries
In this study, we describe our system at the Intellectual Property track of the 2009 CrossLanguage Evaluation Forum campaign (CLEF-IP). The CLEF-IP track addressed prior art searc...
Benjamin Herbert, György Szarvas, Iryna Gurev...
CORR
2010
Springer
230views Education» more  CORR 2010»
14 years 8 months ago
Query-Efficient Locally Decodable Codes of Subexponential Length
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang,...
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 5 hour 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
ECCC
2010
122views more  ECCC 2010»
14 years 10 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
AOSD
2003
ACM
15 years 5 months ago
Navigating and querying code without getting lost
A development task related to a crosscutting concern is challenging because a developer can easily get lost when exploring scattered elements of code and the complex tangle of rel...
Doug Janzen, Kris De Volder