1101 search results - page 132 / 221 » An Algorithm for the Graph Crossing Number Problem |
183
Voted
PDCAT
2005
Springer
15 years 10 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
201
click to vote
ICCV
2005
IEEE
15 years 10 months ago
2005
IEEE
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
145
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
136
click to vote
ICIP
2000
IEEE
16 years 6 months ago
2000
IEEE
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
139
Voted
FUN
2010
Springer
15 years 10 months ago
2010
Springer
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...