Sciweavers

1813 search results - page 53 / 363
» Instance Pruning Techniques
Sort
View
CORR
2010
Springer
147views Education» more  CORR 2010»
14 years 10 months ago
Strong direct product theorems for quantum communication and query complexity
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
Alexander A. Sherstov
ICDE
2010
IEEE
434views Database» more  ICDE 2010»
15 years 5 months ago
Route skyline queries: A multi-preference path planning approach
— In recent years, the research community introduced various methods for processing skyline queries in multidimensional databases. The skyline operator retrieves all objects bein...
Hans-Peter Kriegel, Matthias Renz, Matthias Schube...
CIKM
2009
Springer
15 years 6 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
AIR
2006
152views more  AIR 2006»
14 years 12 months ago
Machine learning: a review of classification and combining techniques
Abstract Supervised classification is one of the tasks most frequently carried out by socalled Intelligent Systems. Thus, a large number of techniques have been developed based on ...
Sotiris B. Kotsiantis, Ioannis D. Zaharakis, Panay...
CORR
2008
Springer
153views Education» more  CORR 2008»
14 years 12 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...