Sciweavers

4536 search results - page 207 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICDE
2008
IEEE
147views Database» more  ICDE 2008»
14 years 11 months ago
Fast Indexes and Algorithms for Set Similarity Selection Queries
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
Marios Hadjieleftheriou, Amit Chandel, Nick Koudas...
ICMCS
2006
IEEE
130views Multimedia» more  ICMCS 2006»
14 years 3 months ago
Directional Weighting-Based Demosaicking Algorithm for Noisy CFA Environments
Captured CFA data by image sensors like CCD/or CMOS are often corrupted by noises. To produce high quality images acquired by CCD/CMOS digital cameras, the problem of noise needs ...
Hung-Yi Lo, Tsung-Nan Lin, Chih-Lung Hsu, Cheng-hs...
ICDM
2005
IEEE
148views Data Mining» more  ICDM 2005»
14 years 3 months ago
Online Hierarchical Clustering in a Data Warehouse Environment
Many important industrial applications rely on data mining methods to uncover patterns and trends in large data warehouse environments. Since a data warehouse is typically updated...
Elke Achtert, Christian Böhm, Hans-Peter Krie...
BMCBI
2004
208views more  BMCBI 2004»
13 years 9 months ago
Using 3D Hidden Markov Models that explicitly represent spatial coordinates to model and compare protein structures
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
Vadim Alexandrov, Mark Gerstein
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
14 years 9 months ago
Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...