234 search results - page 16 / 47 » Randomized splay trees: Theoretical and experimental results |
131
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
112
click to vote
AI
2006
Springer
15 years 5 months ago
2006
Springer
Stochastic local search (SLS) methods are underlying some of the best-performing algorithms for certain types of SAT instances, both from an empirical as well as from a theoretical...
127
Voted
CSCLP
2004
Springer
15 years 7 months ago
2004
Springer
We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques both theoretically and experimentally with hinge deco...
CP
2000
Springer
15 years 6 months ago
2000
Springer
We perform a comprehensive theoretical and empirical study of the benefits of singleton consistencies. Our theoretical results help place singleton consistencies within the hierar...
104
click to vote
ICDM
2003
IEEE
15 years 7 months ago
2003
IEEE
Privacy is becoming an increasingly important issue in many data mining applications. This has triggered the development of many privacy-preserving data mining techniques. A large...