85 search results - page 16 / 17 » Improved Algorithms for Uniform Partitions of Points |
117
click to vote
SDM
2011
SIAM
14 years 11 days ago
2011
SIAM
This paper describes one of the first attempts to model the temporal structure of massive data streams in real-time using data stream clustering. Recently, many data stream clust...
STOC
2002
ACM
15 years 9 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
VIS
2005
IEEE
15 years 10 months ago
2005
IEEE
In a visualization of a three-dimensional dataset, the insights gained are dependent on what is occluded and what is not. Suggestion of interesting viewpoints can improve both the...
SMA
2003
ACM
15 years 2 months ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
109
click to vote
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...