Sciweavers

1813 search results - page 154 / 363
» Instance Pruning Techniques
Sort
View
FROCOS
2011
Springer
14 years 6 months ago
Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT
A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCL) SAT solver and of a decision procedure able to h...
Alberto Griggio, Quoc-Sang Phan, Roberto Sebastian...
WWW
2005
ACM
16 years 7 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
16 years 3 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
SIGCOMM
2006
ACM
16 years 12 days ago
Drafting behind Akamai (travelocity-based detouring)
To enhance web browsing experiences, content distribution networks (CDNs) move web content “closer” to clients by caching copies of web objects on thousands of servers worldwi...
Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovi...
AUSAI
2005
Springer
15 years 12 months ago
K-Optimal Pattern Discovery: An Efficient and Effective Approach to Exploratory Data Mining
Most data-mining techniques seek a single model that optimizes an objective function with respect to the data. In many real-world applications several models will equally optimize...
Geoffrey I. Webb