Sciweavers

480 search results - page 76 / 96
» Algorithmic tests and randomness with respect to a class of ...
Sort
View
STACS
1999
Springer
13 years 11 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
DAGSTUHL
2004
13 years 9 months ago
Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
Erich Novak, Stephan Dahlke, Winfried Sickel
JC
2006
97views more  JC 2006»
13 years 7 months ago
Optimal approximation of elliptic problems by linear and nonlinear mappings II
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
Stephan Dahlke, Erich Novak, Winfried Sickel
BMCBI
2007
178views more  BMCBI 2007»
13 years 7 months ago
SVM clustering
Background: Support Vector Machines (SVMs) provide a powerful method for classification (supervised learning). Use of SVMs for clustering (unsupervised learning) is now being cons...
Stephen Winters-Hilt, Sam Merat