Sciweavers

3875 search results - page 282 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
PVLDB
2010
134views more  PVLDB 2010»
15 years 5 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...
EVOW
2010
Springer
15 years 5 months ago
Finding Gapped Motifs by a Novel Evolutionary Algorithm
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene reg...
Chengwei Lei, Jianhua Ruan
JCP
2007
118views more  JCP 2007»
15 years 6 months ago
Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
Su Chen, Antonio Nucci
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
15 years 6 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 4 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...