Sciweavers

2556 search results - page 349 / 512
» Clustering processes
Sort
View
ICDE
2001
IEEE
201views Database» more  ICDE 2001»
16 years 7 months ago
Approximate Nearest Neighbor Searching in Multimedia Databases
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...
KDD
2006
ACM
121views Data Mining» more  KDD 2006»
16 years 6 months ago
Query-time entity resolution
The goal of entity resolution is to reconcile database references corresponding to the same real-world entities. Given the abundance of publicly available databases where entities...
Indrajit Bhattacharya, Lise Getoor, Louis Licamele
ICASSP
2009
IEEE
16 years 1 months ago
Decentralized variational filtering for simultaneous sensor localization and target tracking in binary sensor networks
Resource limitations in wireless sensor networks have put stringent constraints on distributed signal processing. In this paper, we propose a cluster-based decentralized variation...
Jing Teng, Hichem Snoussi, Cédric Richard
ICPP
2008
IEEE
16 years 27 days ago
Parallel Inferencing for OWL Knowledge Bases
Abstract— We examine the problem of parallelizing the inferencing process for OWL knowledge-bases. A key challenge in this problem is partitioning the computational workload of t...
Ramakrishna Soma, Viktor K. Prasanna
SSDBM
2008
IEEE
115views Database» more  SSDBM 2008»
16 years 25 days ago
Breaking the Curse of Cardinality on Bitmap Indexes
Bitmap indexes are known to be efficient for ad-hoc range queries that are common in data warehousing and scientific applications. However, they suffer from the curse of cardina...
Kesheng Wu, Kurt Stockinger, Arie Shoshani