Sciweavers

4541 search results - page 803 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
GIS
2009
ACM
16 years 7 months ago
Augmenting Cartographic Resources for Autonomous Driving
In this paper we present algorithms for automatically generating a road network description from aerial imagery. The road network inforamtion (RNI) produced by our algorithm inclu...
Young-Woo Seo, Chris Urmson, David Wettergreen Ji...
SIGSOFT
2007
ACM
16 years 7 months ago
Efficient token based clone detection with flexible tokenization
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
Hamid Abdul Basit, Stan Jarzabek
WWW
2004
ACM
16 years 7 months ago
Automatic detection of fragments in dynamically generated web pages
Dividing web pages into fragments has been shown to provide significant benefits for both content generation and caching. In order for a web site to use fragment-based content gen...
Lakshmish Ramaswamy, Arun Iyengar, Ling Liu, Fred ...
WWW
2003
ACM
16 years 7 months ago
Adaptive on-line page importance computation
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance, or page rank is defined as the fixpoint o...
Serge Abiteboul, Mihai Preda, Gregory Cobena
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
16 years 13 days ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan