Sciweavers

134 search results - page 20 / 27
» Local Minimax Learning of Approximately Polynomial Functions
Sort
View
SIAMIS
2010
378views more  SIAMIS 2010»
13 years 2 months ago
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
Sebastian Nowozin, Christoph H. Lampert
ECCC
2010
124views more  ECCC 2010»
13 years 7 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
ISNN
2007
Springer
14 years 1 months ago
Recurrent Fuzzy CMAC for Nonlinear System Modeling
Normal fuzzy CMAC neural network performs well because of its fast learning speed and local generalization capability for approximating nonlinear functions. However, it requires hu...
Floriberto Ortiz Rodriguez, Wen Yu, Marco A. Moren...
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 4 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
CVPR
2007
IEEE
14 years 9 months ago
Differential Camera Tracking through Linearizing the Local Appearance Manifold
The appearance of a scene is a function of the scene contents, the lighting, and the camera pose. A set of n-pixel images of a non-degenerate scene captured from different perspec...
Hua Yang, Marc Pollefeys, Greg Welch, Jan-Michael ...