3105 search results - page 310 / 621 » The Path-Packing Structure of Graphs |
148
Voted
ASIAMS
2007
IEEE
15 years 11 months ago
2007
IEEE
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...
147
Voted
ADBIS
2007
Springer
15 years 10 months ago
2007
Springer
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
131
Voted
ESWS
2010
Springer
15 years 9 months ago
2010
Springer
The sizes of datasets available as RDF (e.g., as part of the Linked Data cloud) are increasing continuously. For instance, the recent DBpedia version consists of nearly 500 million...
138
click to vote
WG
1993
Springer
15 years 8 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
157
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...