Sciweavers

192 search results - page 17 / 39
» Using SAT-Solvers to Compute Inference-Proof Database Instan...
Sort
View
SPIRE
2005
Springer
15 years 5 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
SSD
2005
Springer
105views Database» more  SSD 2005»
15 years 5 months ago
Evaluation of Top-k OLAP Queries Using Aggregate R-Trees
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...
Nikos Mamoulis, Spiridon Bakiras, Panos Kalnis
GIS
2004
ACM
16 years 22 days ago
A partial join approach for mining co-location patterns
Spatial co-location patterns represent the subsets of events whose instances are frequently located together in geographic space. We identified the computational bottleneck in the...
Jin Soung Yoo, Shashi Shekhar
CCGRID
2003
IEEE
15 years 5 months ago
Using grid technologies to face medical image analysis challenges
The availability of digital imagers inside hospitals and their ever growing inspection capabilities have established digital medical images as a key component of many pathologies ...
Johan Montagnat, Vincent Breton, Isabelle E. Magni...
TIT
2010
138views Education» more  TIT 2010»
14 years 6 months ago
Functional compression through graph coloring
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
Vishal Doshi, Devavrat Shah, Muriel Médard,...