2095 search results - page 101 / 419 » Improved pebbling bounds |
121
Voted
KDD
2004
ACM
16 years 1 months ago
2004
ACM
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
CORR
2008
Springer
15 years 26 days ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
115
Voted
WWW
2007
ACM
16 years 1 months ago
2007
ACM
Search queries applied to extract relevant information from the World Wide Web over a period of time may be denoted as continuous search queries. The improvement of continuous sea...
106
Voted
SDM
2009
SIAM
15 years 10 months ago
2009
SIAM
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 ...
110
Voted
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...