401 search results - page 24 / 81 » Algorithms for a Simple Point Placement Problem |
95
Voted
ICIP
2009
IEEE
16 years 25 days ago
2009
IEEE
We propose a method to detect objects and patterns in textures on general surfaces. Our approach applies the Chan?Vese variational model for active contours without edges to the p...
119
click to vote
SGP
2007
15 years 2 months ago
2007
We introduce an algorithm for reconstructing watertight surfaces from unoriented point sets. Using the Voronoi diagram of the input point set, we deduce a tensor field whose princ...
101
click to vote
INFOCOM
1995
IEEE
15 years 3 months ago
1995
IEEE
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Consider a set of n > 2 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities, no central coordination, no direct co...
152
click to vote
CORR
1999
Springer
14 years 11 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...