Sciweavers

31 search results - page 6 / 7
» Local algorithms in (weakly) coloured graphs
Sort
View
ICCV
2007
IEEE
15 years 24 days ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
ICML
2008
IEEE
14 years 11 months ago
Graph transduction via alternating minimization
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
Jun Wang, Tony Jebara, Shih-Fu Chang
CVPR
2010
IEEE
14 years 25 days ago
Simultaneous Searching of Globally Optimal Interacting Surfaces with Shape Priors
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
Qi Song, Xiaodong Wu, Yunlong Liu, Mona Garvin, Mi...
AUIC
2005
IEEE
14 years 4 months ago
Real-time 3D Finger Pointing for an Augmented Desk
The augmented desk is gaining popularity in recent HCI research. Its layout of a large horizontal screen on the desk enhances immersive and intense collaborative experiences. A re...
Le Song, Masahiro Takatsuka
PDIS
1996
IEEE
14 years 3 months ago
Querying the World Wide Web
The World Wide Web is a large, heterogeneous, distributedcollectionof documents connected by hypertext links. The most common technologycurrently used for searching the Web depend...
Alberto O. Mendelzon, George A. Mihaila, Tova Milo