Sciweavers

1015 search results - page 57 / 203
» An efficient algorithm for AS path inferring
Sort
View
DATE
2006
IEEE
91views Hardware» more  DATE 2006»
13 years 11 months ago
Efficient incremental clock latency scheduling for large circuits
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
Christoph Albrecht
CCR
2011
13 years 3 months ago
Measured impact of crooked traceroute
Data collected using traceroute-based algorithms underpins research into the Internet’s router-level topology, though it is possible to infer false links from this data. One sou...
Matthew J. Luckie, Amogh Dhamdhere, kc claffy, Dav...
APCCAS
2006
IEEE
261views Hardware» more  APCCAS 2006»
14 years 2 months ago
Area/Delay Efficient Recoding Methods for Parallel CORDIC Rotations
—In this paper, an area/delay efficient recoding method for parallel CORDIC (COordinate Rotation DIgital Computer) rotation algorithm is proposed. This recoding method can reduce...
Tso-Bing Juang
4OR
2010
148views more  4OR 2010»
13 years 6 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
13 years 6 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo