3740 search results - page 510 / 748 » A Fast Skeletonization Method |
104
Voted
COMPGEOM
2003
ACM
15 years 6 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
118
click to vote
SIGMOD
1999
ACM
15 years 5 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
109
Voted
ICDCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—Stream processing is widely used by today’s applications such as financial data analysis and disaster response. In distributed stream processing systems, machine fail...
113
Voted
ALENEX
2010
15 years 2 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
118
Voted
TIP
1998
15 years 12 days ago
1998
Abstract—In this paper, we propose an optimal quadtree (QT)based motion estimator for video compression. It is optimal in the sense that for a given bit budget for encoding the d...