Sciweavers

1407 search results - page 130 / 282
» Join-Graph Propagation Algorithms
Sort
View
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 9 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
ECCV
2004
Springer
14 years 11 months ago
Probabilistic Multi-view Correspondence in a Distributed Setting with No Central Server
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
Shai Avidan, Yael Moses, Yoram Moses
ICCV
2007
IEEE
14 years 11 months ago
Finding a Closed Boundary by Growing Minimal Paths from a Single Point on 2D or 3D Images
In this paper, we present a new method for segmenting closed contours and surfaces. Our work builds on a variant of the Fast Marching algorithm. First, an initial point on the des...
Fethallah Benmansour, Stephane Bonneau, Laurent D....
ECCV
2008
Springer
14 years 11 months ago
Extracting Moving People from Internet Videos
Abstract. We propose a fully automatic framework to detect and extract arbitrary human motion volumes from real-world videos collected from YouTube. Our system is composed of two s...
Juan Carlos Niebles, Bohyung Han, Andras Ferencz, ...
SEMWEB
2009
Springer
14 years 3 months ago
Actively Learning Ontology Matching via User Interaction
Ontology matching plays a key role for semantic interoperability. Many methods have been proposed for automatically finding the alignment between heterogeneous ontologies. However...
Feng Shi, Juanzi Li, Jie Tang, Guo Tong Xie, Hanyu...