Sciweavers

8824 search results - page 86 / 1765
» On the Complexity of Real Functions
Sort
View
CC
2010
Springer
120views System Software» more  CC 2010»
15 years 1 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
CVPR
2011
IEEE
15 years 14 days ago
Multi-Level Inference by Relaxed Dual Decomposition for Human Pose Segmentation
Combining information from the higher level and the lower level has long been recognized as an essential component in holistic image understanding. However, an efficient inferenc...
Huayan Wang, Daphne Koller
139
Voted
CORR
2011
Springer
158views Education» more  CORR 2011»
14 years 11 months ago
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
Michael Burr, Felix Krahmer
127
Voted
ALT
2003
Springer
16 years 1 months ago
Intrinsic Complexity of Uniform Learning
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
Sandra Zilles
CHI
2003
ACM
16 years 4 months ago
Personal universal controllers: controlling complex appliances with GUIs and speech
We envision a future where each person will carry with them a personal universal controller (PUC), a portable computerized device that allows the user to control any appliance wit...
Jeffrey Nichols, Brad A. Myers, Michael Higgins, J...