Sciweavers

232 search results - page 36 / 47
» Fast High-Dimensional Data Search in Incomplete Databases
Sort
View
UAI
2003
15 years 1 months ago
Robust Independence Testing for Constraint-Based Learning of Causal Structure
This paper considers a method that combines ideas from Bayesian learning, Bayesian network inference, and classical hypothesis testing to produce a more reliable and robust test o...
Denver Dash, Marek J. Druzdzel
137
Voted
CATA
1998
15 years 1 months ago
QVI: Query-based virtual index for distributed information retrieval
The large unstructured text collections demand full-text search capabilities from IR systems. Current systems typically allow users only to connect to a single database (or site) ...
Dong-gyu Kim, Sang-goo Lee
ICDE
2003
IEEE
144views Database» more  ICDE 2003»
16 years 1 months ago
Scalable template-based query containment checking for web semantic caches
Semantic caches, originally proposed for client-server database systems, are being recently deployed to accelerate the serving of dynamic web content by transparently caching data...
Khalil Amiri, Sanghyun Park, Renu Tewari, Sriram P...
78
Voted
SISAP
2008
IEEE
153views Data Mining» more  SISAP 2008»
15 years 6 months ago
Counting Distance Permutations
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
Matthew Skala
SSD
2007
Springer
124views Database» more  SSD 2007»
15 years 5 months ago
Querying Objects Modeled by Arbitrary Probability Distributions
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
Christian Böhm, Peter Kunath, Alexey Pryakhin...