5100 search results - page 671 / 1020 » The Linear Complexity of a Graph |
184
click to vote
COLT
2003
Springer
15 years 12 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
185
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Let (S, d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function dw, wher...
181
click to vote
PACT
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...
163
click to vote
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
We describe a kinetic data structure (KDS) that maintains the connected components of the union of a set of unit-radius disks moving in the plane. We assume that the motion of eac...
183
click to vote
IDA
1999
Springer
15 years 11 months ago
1999
Springer
Grand tour is a method for viewing multidimensional data via linear projections onto a sequence of two dimensional subspaces and then moving continuously from one projection to the...