1162 search results - page 126 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
Geometric active contours are formulated in a manner which is parametrization independent. As such, they are amenable to representation as the zero level set of the graph of a hig...
JCO
2010
13 years 6 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
WAW
2007
Springer
14 years 2 months ago
2007
Springer
Popular reputation systems for linked networks can be manipulated by spammers who strategically place links. The reputation of node v is interpreted as the world’s opinion of v...
ISMAR
2007
IEEE
14 years 2 months ago
2007
IEEE
We present an efficient and accurate object tracking algorithm based on the concept of graph cut segmentation. The ability to track visible objects in real-time provides an inval...
IJCV
2006
13 years 8 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...