Sciweavers

1290 search results - page 123 / 258
» Data Dependence Testing in Practice
Sort
View
ICGI
2010
Springer
13 years 11 months ago
Enhanced Suffix Arrays as Language Models: Virtual k-Testable Languages
Abstract. In this article, we propose the use of suffix arrays to efficiently implement n-gram language models with practically unlimited size n. This approach, which is used with ...
Herman Stehouwer, Menno van Zaanen
ICASSP
2010
IEEE
13 years 10 months ago
MMSE based noise PSD tracking with low complexity
Most speech enhancement algorithms heavily depend on the noise power spectral density (PSD). Because this quantity is unknown in practice, estimation from the noisy data is necess...
Richard C. Hendriks, Richard Heusdens, Jesper Jens...
JMLR
2006
113views more  JMLR 2006»
13 years 10 months ago
Learning the Structure of Linear Latent Variable Models
We describe anytime search procedures that (1) find disjoint subsets of recorded variables for which the members of each subset are d-separated by a single common unrecorded cause...
Ricardo Silva, Richard Scheines, Clark Glymour, Pe...
ISBI
2007
IEEE
14 years 4 months ago
Automated Segmentation of the Right Heart Using an Optimized Shells and Spheres Algorithm
We have developed a novel framework for medical image analysis, known as Shells and Spheres. This framework utilizes spherical operators of variable radius centered at each image ...
Aaron Cois, Ken J. Rockot, John M. Galeotti, Rober...
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
14 years 2 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen