3096 search results - page 452 / 620 » The Generalized FITC Approximation |
158
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
245
Voted
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
137
Voted
PODS
2008
ACM
16 years 6 months ago
2008
ACM
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
163
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
163
Voted
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
Abstract. The retrieval of objects from a multimedia database employs a measure which defines a similarity score for every pair of objects. The measure should effectively follow th...