Sciweavers

3020 search results - page 197 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
ECIR
2010
Springer
15 years 8 months ago
Improving Retrievability of Patents in Prior-Art Search
Prior-art search is an important task in patent retrieval. The success of this task relies upon the selection of relevant search queries. Typically terms for prior-art queries are ...
Shariq Bashir, Andreas Rauber
DAGSTUHL
2004
15 years 8 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
OTM
2010
Springer
15 years 4 months ago
Supporting Complex Changes in Evolving Interrelated Web Databanks
In this paper we deal with problems occurring in evolving interrelated Web databanks. Examples of such databanks are networks of interlinked scientific repositories on the Web, man...
Yannis Stavrakas, George Papastefanatos
P2P
2003
IEEE
110views Communications» more  P2P 2003»
15 years 12 months ago
Range Addressable Network: A P2P Cache Architecture for Data Ranges
Peer-to-peer computing paradigm is emerging as a scalable and robust model for sharing media objects. In this paper, we propose an architecture and describe the associated algorit...
Anshul Kothari, Divyakant Agrawal, Abhishek Gupta,...
COMGEO
2008
ACM
15 years 6 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos