Sciweavers

2294 search results - page 56 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
TON
2010
158views more  TON 2010»
14 years 8 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
GISCIENCE
2008
Springer
140views GIS» more  GISCIENCE 2008»
14 years 10 months ago
Modeling Herds and Their Evolvements from Trajectory Data
A trajectory is the time-stamped path of a moving entity through space. Given a set of trajectories, this paper proposes new conceptual definitions for a spatio-temporal pattern n...
Yan Huang, Cai Chen, Pinliang Dong
ICCS
2007
Springer
15 years 1 months ago
Hamiltonian Connected Line Graphs
1 A graph G is hamiltonian-connected if any two of its vertices are connected by a Hamilton2 path (a path including every vertex of G); and G is s-hamiltonian-connected if the del...
Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Z...
DAC
1996
ACM
15 years 1 months ago
Using Register-Transfer Paths in Code Generation for Heterogeneous Memory-Register Architectures
In this paper we address the problem of code generation for basic blocks in heterogeneous memory-register DSP processors. We propose a new a technique, based on register-transfer ...
Guido Araujo, Sharad Malik, Mike Tien-Chien Lee
FOCS
1991
IEEE
15 years 1 months ago
On the Exponent of the All Pairs Shortest Path Problem
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
Noga Alon, Zvi Galil, Oded Margalit