Sciweavers

1447 search results - page 58 / 290
» Graphs and Path Equilibria
Sort
View
124
Voted
DCC
2008
IEEE
15 years 10 months ago
Adaptive Compression of Graph Structured Text
In this paper we introduce an adaptive technique for compressing small quantities of text which are organized as a rooted directed graph. We impose a constraint on the technique s...
John Gilbert, David M. Abrahamson
178
Voted
COMGEO
2006
ACM
15 years 3 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
132
Voted
SIROCCO
1998
15 years 5 months ago
Characterization results of all shortest paths interval routing schemes
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1...
Michele Flammini, Giorgio Gambosi, Umberto Nanni, ...
119
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
Distributed Navigation Algorithms for Sensor Networks
— We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations ...
Chiranjeeb Buragohain, Divyakant Agrawal, Subhash ...
114
Voted
VLDB
2005
ACM
82views Database» more  VLDB 2005»
15 years 9 months ago
Stack-based Algorithms for Pattern Matching on DAGs
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
Li Chen, Amarnath Gupta, M. Erdem Kurul