332 search results - page 35 / 67 » Space Complexity vs. Query Complexity |
SMA
2010
ACM
13 years 10 months ago
2010
ACM
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
RSCTC
2000
Springer
14 years 1 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
KDD
2007
ACM
14 years 10 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...
COCOON
2005
Springer
14 years 3 months ago
2005
Springer
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
GIS
2009
ACM
14 years 2 months ago
2009
ACM
Data warehouses and On-Line Analytical Processing (OLAP) provide an analysis framework supporting the decision making process. In many application domains, complex analysis tasks ...