Sciweavers

115 search results - page 14 / 23
» Geometric graphs with no two parallel edges
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
A Graph-matching Kernel for Object Categorization
This paper addresses the problem of category-level image classification. The underlying image model is a graph whose nodes correspond to a dense set of regions, and edges reflec...
Olivier Duchenne, Armand Joulin, Jean Ponce
FOCS
2008
IEEE
14 years 1 months ago
Dynamic Connectivity: Connecting to Networks and Geometry
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
Timothy M. Chan, Mihai Patrascu, Liam Roditty
SODA
2008
ACM
123views Algorithms» more  SODA 2008»
13 years 8 months ago
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
Xiaomin Chen, János Pach, Mario Szegedy, G&...
ICPR
2008
IEEE
14 years 8 months ago
Automatic bi-layer video segmentation based on sensor fusion
We propose a new solution to the problem of bilayer video segmentation in terms of both, hardware design and algorithmic solution. At the data acquisition stage, we combine color ...
Pierre Boulanger, Qiong Wu, Walter F. Bischof
DAM
2011
12 years 11 months ago
Triangular line graphs and word sense disambiguation
Linguists often represent the relationships between words in a collection of text as an undirected graph G = (V, E), were V is the vocabulary and vertices are adjacent in G if and...
Pranav Anand, Henry Escuadro, Ralucca Gera, Craig ...