82 search results - page 8 / 17 » Efficient theory combination via boolean search |
202
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
ICDM
2005
IEEE
15 years 5 months ago
2005
IEEE
Accurate topical classification of user queries allows for increased effectiveness and efficiency in general-purpose web search systems. Such classification becomes critical if th...
109
click to vote
SARA
2009
Springer
15 years 6 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
CSL
2010
Springer
15 years 24 days ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
CIKM
2003
Springer
15 years 4 months ago
2003
Springer
Prior research into search system scalability has primarily addressed query processing efficiency [1, 2, 3] or indexing efficiency [3], or has presented some arbitrary system arch...