Sciweavers

45 search results - page 7 / 9
» Small Maximal Matchings in Random Graphs
Sort
View
TCSV
2002
229views more  TCSV 2002»
13 years 7 months ago
Automatic segmentation of moving objects in video sequences: a region labeling approach
Abstract--The emerging video coding standard MPEG-4 enables various content-based functionalities for multimedia applications. To support such functionalities, as well as to improv...
Yaakov Tsaig, Amir Averbuch
ECCV
2004
Springer
14 years 9 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
MOR
2010
118views more  MOR 2010»
13 years 6 months ago
Strategyproof Approximation of the Minimax on Networks
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
13 years 7 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
TIP
2010
129views more  TIP 2010»
13 years 2 months ago
Image Segmentation by MAP-ML Estimations
Abstract--Image segmentation plays an important role in computer vision and image analysis. In this paper, image segmentation is formulated as a labeling problem under a probabilit...
Shifeng Chen, Liangliang Cao, Yueming Wang, Jianzh...