Sciweavers

5746 search results - page 778 / 1150
» Visualizing Query Structure
Sort
View
EDBT
2009
ACM
108views Database» more  EDBT 2009»
15 years 11 months ago
Reverse k-nearest neighbor search in dynamic and general metric databases
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...
Elke Achtert, Hans-Peter Kriegel, Peer Kröger...
COOPIS
1997
IEEE
15 years 11 months ago
Semi-Automatic Wrapper Generation for Internet Information Sources
To simplify the task of obtaining information from the vast number of information sources that are available on the World Wide Web (WWW), we are building tools to build informatio...
Naveen Ashish, Craig A. Knoblock
IPPS
1997
IEEE
15 years 11 months ago
d-Dimensional Range Search on Multicomputers
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin...
GCB
2006
Springer
99views Biometrics» more  GCB 2006»
15 years 10 months ago
Shape Distributions and Protein Similarity
: In this paper we describe a similarity model that provides the objective basis for clustering proteins of similar structure. More specifically, we consider the following variant ...
Stefan Canzar, Jan Remy
187
Voted
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
15 years 10 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams