2880 search results - page 155 / 576 » Approximate Range Searching |
136
Voted
KI
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
231
Voted
AMT
2010
Springer
15 years 5 months ago
2010
Springer
One of the major problems for search at Web scale is that the search results on the large scale data might be huge and the users have to browse to find the most relevant ones. Plus...
133
Voted
AAAI
2010
15 years 5 months ago
2010
On the surface, bidirectional search (BDS) is an attractive idea with the potential for significant asymptotic reductions in search effort. However, the results in practice often ...
130
Voted
AAAI
2004
15 years 5 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
116
click to vote
SSWMC
2004
15 years 5 months ago
2004
Steganalysis in the wide sense consists of first identifying suspicious objects and then further analysis during which we try to identify the steganographic scheme used for embedd...