3122 search results - page 177 / 625 » Storing Semistructured Data with STORED |
172
click to vote
ICDE
2007
IEEE
15 years 12 months ago
2007
IEEE
Retrieval queries that combine structural constraints with keyword search represent a significant challenge to XML data management systems. Queries are expected to be answered as...
166
click to vote
IBPRIA
2007
Springer
15 years 11 months ago
2007
Springer
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
180
click to vote
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
156
click to vote
ROBOCUP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Recent successful SLAM methods employ hybrid map representations combining the strengths of topological maps and occupancy grids. Such representations often facilitate mu...
170
click to vote
CONEXT
2006
ACM
15 years 11 months ago
2006
ACM
Running the Border Gateway Protocol (BGP), the Internet’s interdomain routing protocol, consumes a large amount of memory. A BGP-speaking router typically stores one or more rou...