3702 search results - page 392 / 741 » All Pairings Are in a Group |
222
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
164
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here ali...
205
Voted
3DIM
2001
IEEE
15 years 10 months ago
2001
IEEE
In this paper, we present a method for automatically creating a 3D model of a scene from a set of range images obtained from unknown viewpoints. Existing 3D modeling approaches re...
169
Voted
IMR
2000
Springer
15 years 10 months ago
2000
Springer
We present an effective and easy-to-implement angle-based smoothing scheme for triangular, quadrilateral and tri-quad mixed meshes. For each mesh node our algorithm compares all t...
165
click to vote
MICCAI
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. An N-dimensional image is divided into "object" and "background" segments using a graph cut approach. A graph is formed by connecting all pairs of nei...