Sciweavers

1019 search results - page 96 / 204
» Uniform Functors on Sets
Sort
View
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
13 years 10 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
ACL
1992
13 years 10 months ago
Lattice-Based Word Identification in CLARE
I argue that because of spelling and typing errors and other properties of typed text, the identification of words and word boundaries in general requires syntactic and semantic k...
David M. Carter
SMA
2010
ACM
187views Solid Modeling» more  SMA 2010»
13 years 9 months ago
Polygonizing extremal surfaces with manifold guarantees
Extremal surfaces are a class of implicit surfaces that have been found useful in a variety of geometry reconstruction applications. Compared to iso-surfaces, extremal surfaces ar...
Ruosi Li, Lu Liu, Ly Phan, Sasakthi S. Abeysinghe,...
ICASSP
2010
IEEE
13 years 9 months ago
On unbiased estimation of sparse vectors corrupted by Gaussian noise
We consider the estimation of a sparse parameter vector from measurements corrupted by white Gaussian noise. Our focus is on unbiased estimation as a setting under which the difï¬...
Alexander Jung, Zvika Ben-Haim, Franz Hlawatsch, Y...
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 9 months ago
A finiteness structure on resource terms
In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinati...
Thomas Ehrhard