Sciweavers

246 search results - page 15 / 50
» Bichain graphs: Geometric model and universal graphs
Sort
View
SMA
2003
ACM
118views Solid Modeling» more  SMA 2003»
15 years 2 months ago
Graph based topological analysis of tessellated surfaces
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
Tula Ram Ban, Dibakar Sen
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
15 years 3 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
ICMCS
2006
IEEE
143views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Object Recognition and Recovery by Skeleton Graph Matching
This paper presents a robust and efficient skeleton-based graph matching method for object recognition and recovery applications. The novel feature is to unify both object recogni...
Lei He, Chia Y. Han, William G. Wee
TCSV
2008
202views more  TCSV 2008»
14 years 9 months ago
Probabilistic Object Tracking With Dynamic Attributed Relational Feature Graph
Object tracking is one of the fundamental problems in computer vision and has received considerable attention in the past two decades. The success of a tracking algorithm relies on...
Feng Tang, Hai Tao
COMPGEOM
2010
ACM
15 years 2 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...