1728 search results - page 20 / 346 » The Accelerated Euclidean Algorithm |
164
Voted
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
In the context of variational image segmentation, we propose a new finite-dimensional implicit surface representation. The key idea is to span a subset of implicit functions with ...
127
click to vote
ESA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In a seminal STOC'95 paper, Arya et al. [4] devised a construction that for any set S of n points in Rd and any > 0, provides a (1 + )-spanner with diameter O(lo...
180
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
149
click to vote
COLT
2006
Springer
15 years 7 months ago
2006
Springer
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
153
Voted
ICCV
2009
IEEE
16 years 10 months ago
2009
IEEE
Common visual codebook generation methods used in
a Bag of Visual words model, e.g. k-means or Gaussian
Mixture Model, use the Euclidean distance to cluster features
into visual...