14 search results - page 3 / 3 » Triangulations without pointed spanning trees |
JAIR
2008
13 years 5 months ago
2008
In this paper, we show that a continuous spectrum of randomisation exists, in which most existing tree randomisations are only operating around the two ends of the spectrum. That ...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
SSPR
2004
Springer
13 years 10 months ago
2004
Springer
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
STOC
2005
ACM
13 years 10 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...