Sciweavers

811 search results - page 51 / 163
» An efficient algorithm for the configuration problem of domi...
Sort
View
ICMCS
2007
IEEE
203views Multimedia» more  ICMCS 2007»
14 years 4 months ago
Efficient Video Object Segmentation by Graph-Cut
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
Jinjun Wang, Wei Xu, Shenghuo Zhu, Yihong Gong
SEMWEB
2009
Springer
14 years 5 months ago
Graph-Based Ontology Construction from Heterogenous Evidences
Abstract. Ontologies are tools for describing and structuring knowledge, with many applications in searching and analyzing complex knowledge bases. Since building them manually is ...
Christoph Böhm, Philip Groth, Ulf Leser
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 7 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
MVA
2008
305views Computer Vision» more  MVA 2008»
13 years 10 months ago
A new graph cut-based multiple active contour algorithm without initial contours and seed points
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
Jong-Sung Kim, Ki-Sang Hong
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
14 years 2 months ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...