Sciweavers

1192 search results - page 56 / 239
» Symbolic Query Exploration
Sort
View
120
Voted
STOC
2009
ACM
224views Algorithms» more  STOC 2009»
16 years 2 months ago
3-query locally decodable codes of subexponential length
Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of t...
Klim Efremenko
100
Voted
SEDE
2007
15 years 3 months ago
An extensive math query language
Math search is a new area of research with many enabling technologies but also many challenges. Some of the enabling technologies include XML, XPath, XQuery, and MathML. Some of t...
Abdou S. Youssef, Moody Ebrahem Altamimi
112
Voted
ICMCS
1999
IEEE
131views Multimedia» more  ICMCS 1999»
15 years 6 months ago
Integrating Web Resources and Lexicons into a Natural Language Query System
The START system responds to natural language queries with answers in text, pictures, and other media. START's sentence-level natural language parsing relies on a number of m...
Boris Katz, Deniz Yuret, Jimmy J. Lin, Sue Felshin...
109
Voted
CORR
2010
Springer
230views Education» more  CORR 2010»
14 years 10 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,...
ALT
2000
Springer
15 years 6 months ago
On the Hardness of Learning Acyclic Conjunctive Queries
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
Kouichi Hirata