Sciweavers

1949 search results - page 303 / 390
» Random graphs on surfaces
Sort
View
CORR
2006
Springer
146views Education» more  CORR 2006»
15 years 3 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram
JCB
2002
160views more  JCB 2002»
15 years 3 months ago
Inference from Clustering with Application to Gene-Expression Microarrays
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
Edward R. Dougherty, Junior Barrera, Marcel Brun, ...
227
Voted
CVPR
2009
IEEE
16 years 11 months ago
Isometric Registration of Ambiguous and Partial Data
This paper introduces a new shape matching algorithm for computing correspondences between 3D surfaces that have undergone (approximately) isometric deformations. The new approach ...
Art Tevs (Max Planck Institute Informatik), Martin...
138
Voted
CVPR
2006
IEEE
16 years 6 months ago
Stereo Matching with Symmetric Cost Functions
Recently, many global stereo methods have achieved good results by modeling a disparity surface as a Markov random field (MRF) and by solving an optimization problem with various ...
Kuk-Jin Yoon, In-So Kweon
128
Voted
ICCV
1999
IEEE
16 years 5 months ago
Measuring Convexity for Figure/Ground Separation
In human perception, convex surfaces have a strong tendency to be perceived as the "figure". Convexity has a stronger influence on figural organization than other global...
Hsing-Kuo Pao, Davi Geiger, Nava Rubin