Sciweavers

97 search results - page 4 / 20
» The Randomness Recycler: A New Technique for Perfect Samplin...
Sort
View
ICDE
2006
IEEE
142views Database» more  ICDE 2006»
14 years 9 months ago
End-biased Samples for Join Cardinality Estimation
We present a new technique for using samples to estimate join cardinalities. This technique, which we term "end-biased samples," is inspired by recent work in network tr...
Cristian Estan, Jeffrey F. Naughton
SAC
2011
ACM
13 years 2 months ago
Slice sampling mixture models
We propose a more efficient version of the slice sampler for Dirichlet process mixture models described by Walker (2007). This sampler allows the fitting of infinite mixture mod...
Maria Kalli, Jim E. Griffin, Stephen G. Walker
ICIP
2009
IEEE
13 years 5 months ago
Randomness-in-Structured Ensembles for compressed sensing of images
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
Abdolreza A. Moghadam, Hayder Radha
CLIN
2001
13 years 9 months ago
Applying Monte Carlo Techniques to Language Identification
Two major stages stages in language identification systems can be identified: the language modeling stage, where the distinctive features of languages are determined and stored in...
Arjen Poutsma
PAKDD
2004
ACM
131views Data Mining» more  PAKDD 2004»
14 years 1 months ago
A Tree-Based Approach to the Discovery of Diagnostic Biomarkers for Ovarian Cancer
Computational diagnosis of cancer is a classification problem, and it has two special requirements on a learning algorithm: perfect accuracy and small number of features used in t...
Jinyan Li, Kotagiri Ramamohanarao