6004 search results - page 1158 / 1201 » Parallelizing query optimization |
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
Abstract. Most existing search engines employ static ranking algorithms that do not adapt to the specific needs of users. Recently, some researchers have studied the use of clickth...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...