Sciweavers

736 search results - page 69 / 148
» A dynamic data structure for approximate range searching
Sort
View
VLDB
2001
ACM
129views Database» more  VLDB 2001»
14 years 1 months ago
Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
Yasushi Sakurai, Masatoshi Yoshikawa, Ryoji Kataok...
EWCBR
2004
Springer
14 years 2 months ago
Dynamic Critiquing
Abstract. Critiquing is a powerful style of feedback for case-based recommender systems. Instead of providing detailed feature values, users indicate a directional preference for a...
James Reilly, Kevin McCarthy, Lorraine McGinty, Ba...
COMAD
2008
13 years 10 months ago
Kshitij: A Search and Page Recommendation System for Wikipedia
Semantic information helps in identifying the context of a document. It will be interesting to find out how effectively this information can be used in recommending related docume...
Phanikumar Bhamidipati, Kamalakar Karlapalem
STACS
1997
Springer
14 years 27 days ago
Predecessor Queries in Dynamic Integer Sets
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
Gerth Stølting Brodal
P2P
2008
IEEE
120views Communications» more  P2P 2008»
14 years 3 months ago
Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks
Trees are fundamental structures for data dissemination in large-scale network scenarios. However, their inherent fragility has led researchers to rely on more redundant mesh topo...
Davide Frey, Amy L. Murphy