Sciweavers

138 search results - page 2 / 28
» Entropy Numbers of Linear Function Classes
Sort
View
ICALP
2004
Springer
13 years 11 months ago
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
Olivier Bournez, Emmanuel Hainry
JMLR
2010
101views more  JMLR 2010»
13 years 28 days ago
Classification Using Geometric Level Sets
A variational level set method is developed for the supervised classification problem. Nonlinear classifier decision boundaries are obtained by minimizing an energy functional tha...
Kush R. Varshney, Alan S. Willsky
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 7 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
COLT
1994
Springer
13 years 10 months ago
Lower Bounds on the VC-Dimension of Smoothly Parametrized Function Classes
We examine the relationship between the VCdimension and the number of parameters of a smoothly parametrized function class. We show that the VC-dimension of such a function class ...
Wee Sun Lee, Peter L. Bartlett, Robert C. Williams...
FUIN
2006
89views more  FUIN 2006»
13 years 6 months ago
Recursive Analysis Characterized as a Class of Real Recursive Functions
Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementary functions over the real numbers in the sense of recursive a...
Olivier Bournez, Emmanuel Hainry