Sciweavers

234 search results - page 32 / 47
» Rademacher Margin Complexity
Sort
View
PODS
2008
ACM
250views Database» more  PODS 2008»
14 years 7 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 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...
ALT
2007
Springer
14 years 4 months ago
Learning Kernel Perceptrons on Noisy Data Using Random Projections
In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classific...
Guillaume Stempfel, Liva Ralaivola
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
14 years 4 months ago
Leveraging protocol knowledge in slack matching
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
Girish Venkataramani, Seth Copen Goldstein
ICDAR
2009
IEEE
14 years 2 months ago
Learning and Adaptation for Improving Handwritten Character Recognizers
Writer independent handwriting recognition systems are limited in their accuracy, primarily due the large variations in writing styles of most characters. Samples from a single ch...
Naveen Chandra Tewari, Anoop M. Namboodiri