Sciweavers

143 search results - page 20 / 29
» Indexing correlated probabilistic databases
Sort
View
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
16 years 1 months ago
Greedy List Intersection
A common technique for processing conjunctive queries is to first match each predicate separately using an index lookup, and then compute the intersection of the resulting rowid li...
Robert Krauthgamer, Aranyak Mehta, Vijayshankar Ra...
SIGMOD
2007
ACM
196views Database» more  SIGMOD 2007»
15 years 12 months ago
Adaptive location constraint processing
An important problem for many location-based applications is the continuous evaluation of proximity relations among moving objects. These relations express whether a given set of ...
Zhengdao Xu, Hans-Arno Jacobsen
EDBT
2009
ACM
207views Database» more  EDBT 2009»
15 years 2 months ago
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these ...
Reynold Cheng, Lei Chen 0002, Jinchuan Chen, Xike ...
PODS
1998
ACM
152views Database» more  PODS 1998»
15 years 3 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
TMI
1998
140views more  TMI 1998»
14 years 11 months ago
Automated Seeded Lesion Segmentation on Digital Mammograms
Abstract—Segmenting lesions is a vital step in many computerized mass-detection schemes for digital (or digitized) mammograms. We have developed two novel lesion segmentation tec...
Matthew A. Kupinski, Maryellen L. Giger