Sciweavers

948 search results - page 154 / 190
» On Spatial Information Retrieval and Database Generalization
Sort
View
KDD
2002
ACM
109views Data Mining» more  KDD 2002»
14 years 11 months ago
Topics in 0--1 data
Large 0-1 datasets arise in various applications, such as market basket analysis and information retrieval. We concentrate on the study of topic models, aiming at results which in...
Ella Bingham, Heikki Mannila, Jouni K. Seppän...
PODS
2006
ACM
216views Database» more  PODS 2006»
14 years 11 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
WWW
2010
ACM
14 years 5 months ago
SourceRank: relevance and trust assessment for deep web sources based on inter-source agreement
We consider the problem of deep web source selection and argue that existing source selection methods are inadequate as they are based on local similarity assessment. Specificall...
Raju Balakrishnan, Subbarao Kambhampati
MIDDLEWARE
2005
Springer
14 years 4 months ago
Adaptive query processing in mobile environment
These last years, the evolution of nomadic terminals and mobile networks has yield to the development of the ubiquitous computing. In this context, actual query evaluation and opt...
Hocine Grine, Thierry Delot, Sylvain Lecomte
SPIRE
2005
Springer
14 years 4 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez