Sciweavers

301 search results - page 16 / 61
» An efficient algorithm to verify generalized false paths
Sort
View
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
14 years 8 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
CODES
2009
IEEE
13 years 9 months ago
Efficient dynamic voltage/frequency scaling through algorithmic loop transformation
We present a novel loop transformation technique, particularly well suited for optimizing embedded compilers, where an increase in compilation time is acceptable in exchange for s...
Mohammad Ali Ghodrat, Tony Givargis
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 8 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
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
DAGSTUHL
2006
13 years 9 months ago
A System for Object Class Detection
A successful detection and classification system must have two properties: it should be general enough to compensate for intra-class variability and it should be specific enough to...
Daniela Hall