Sciweavers

52 search results - page 6 / 11
» Learning Polynomials with Queries: The Highly Noisy Case
Sort
View
FOCS
2002
IEEE
14 years 15 days ago
Learning Intersections and Thresholds of Halfspaces
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
SAC
2008
ACM
13 years 6 months ago
Strangeness-based feature weighting and classification of gene expression profiles
Achieving high classification accuracy is a major challenge in the diagnosis of cancer types based on gene expression profiles. These profiles are notoriously noisy in that a larg...
Haifeng Shao, Bei Yu, Joseph H. Nadeau
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 11 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
ICASSP
2010
IEEE
13 years 5 months ago
Speech enhancement with sparse coding in learned dictionaries
The enhancement of speech degraded by non-stationary interferers is a highly relevant and difficult task of many signal processing applications. We present a monaural speech enhan...
Christian D. Sigg, Tomas Dikk, Joachim M. Buhmann
WWW
2007
ACM
14 years 8 months ago
Organizing and searching the world wide web of facts -- step two: harnessing the wisdom of the crowds
As part of a large effort to acquire large repositories of facts from unstructured text on the Web, a seed-based framework for textual information extraction allows for weakly sup...
Marius Pasca