Sciweavers

1666 search results - page 100 / 334
» Effective and efficient structured retrieval
Sort
View
TPDS
2008
74views more  TPDS 2008»
13 years 10 months ago
NRMI: Natural and Efficient Middleware
We present NRMI: a drop-in replacement for Java RMI that supports call-by-copy-restore semantics for arbitrary linked data structures, in addition to regular call-by-copy semantic...
Eli Tilevich, Yannis Smaragdakis
GIR
2006
ACM
14 years 4 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai
MIR
2006
ACM
120views Multimedia» more  MIR 2006»
14 years 4 months ago
Scalable search-based image annotation of personal images
With the prevalence of digital cameras, more and more people have considerable digital images on their personal devices. As a result, there are increasing needs to effectively sea...
Changhu Wang, Feng Jing, Lei Zhang, HongJiang Zhan...
COSIT
1997
Springer
143views GIS» more  COSIT 1997»
14 years 2 months ago
Using Hierarchical Spatial Data Structures for Hierarchical Spatial Reasoning
This paper gives a definition of Hierarchical Spatial Reasoning, which computes increasingly better results in a hierarchical fashion and stops the computation when a result is ac...
Sabine Timpf, Andrew U. Frank
GEOINFO
2003
13 years 11 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...