Sciweavers

4541 search results - page 55 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
SIGCOMM
2010
ACM
14 years 11 months ago
DDE: dynamic data structure excavation
Dynamic Datastructure Excavation (DDE) is a new approach to extract datastructures from C binaries without any need for debugging symbols. Unlike most existing tools, DDE uses dyn...
Asia Slowinska, Traian Stancescu, Herbert Bos
ICML
2002
IEEE
15 years 12 months ago
Kernels for Semi-Structured Data
Semi-structured data such as XML and HTML is attracting considerable attention. It is important to develop various kinds of data mining techniques that can handle semistructured d...
Hisashi Kashima, Teruo Koyanagi
PCI
2005
Springer
15 years 4 months ago
Storing and Locating Mutable Data in Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer overlay networks or Distributed Hash Tables (DHTs) are distributed systems optimized for storage and retrieval of read-only data. In this paper we elaborate...
Antony Chazapis, Nectarios Koziris
TGIS
2010
86views more  TGIS 2010»
14 years 5 months ago
A Road Network Selection Process Based on Data Enrichment and Structure Detection
The presented paper deals with a generic process for road network selection based on data enrichment and structure detection. The first step is to detect significant structures and...
Guillaume Touya
ISAAC
2005
Springer
118views Algorithms» more  ISAAC 2005»
15 years 4 months ago
External Data Structures for Shortest Path Queries on Planar Digraphs
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
Lars Arge, Laura Toma