Sciweavers

650 search results - page 44 / 130
» Positive graphs
Sort
View
CCCG
2008
14 years 19 days ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
IDMS
1998
Springer
122views Multimedia» more  IDMS 1998»
14 years 3 months ago
Object Graphs as Pivotal Representations for Hypermedia
This position paper advocates a possible bridging of multiple heterogeneous formats and interfaces for hypermedia data and metadata. Rather than one more text, bit-stream or proced...
Marc Brelot, Gilles Privat
CLEAR
2006
Springer
133views Biometrics» more  CLEAR 2006»
14 years 2 months ago
Multi-feature Graph-Based Object Tracking
We present an object detection and tracking algorithm that addresses the problem of multiple simultaneous targets tracking in realworld surveillance scenarios. The algorithm is bas...
Murtaza Taj, Emilio Maggio, Andrea Cavallaro
NIPS
2007
14 years 18 days ago
Rapid Inference on a Novel AND/OR graph for Object Detection, Segmentation and Parsing
In this paper we formulate a novel AND/OR graph representation capable of describing the different configurations of deformable articulated objects such as horses. The representa...
Yuanhao Chen, Long Zhu, Chenxi Lin, Alan L. Yuille...
GD
2008
Springer
14 years 8 days ago
Succinct Greedy Graph Drawing in the Hyperbolic Plane
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
David Eppstein, Michael T. Goodrich