Sciweavers

59 search results - page 7 / 12
» Real and integer domination in graphs
Sort
View
IROS
2006
IEEE
108views Robotics» more  IROS 2006»
14 years 1 months ago
Sparse appearance based modeling for robot localization
— In appearance based robot localization a new image is matched with every image in the database. In this paper we describe how to reduce the number of images in this database wi...
Olaf Booij, Zoran Zivkovic, Ben J. A. Kröse
ICCV
2007
IEEE
14 years 9 months ago
Untangling Cycles for Contour Grouping
We introduce a novel topological formulation for contour grouping. Our grouping criterion, called untangling cycles, exploits the inherent topological 1D structure of salient cont...
Qihui Zhu, Gang Song, Jianbo Shi
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
14 years 4 hour ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
14 years 8 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
13 years 11 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...