1243 search results - page 174 / 249 » On the locality of bounded growth |
163
click to vote
NIPS
2004
15 years 7 months ago
2004
We study a method of optimal data-driven aggregation of classifiers in a convex combination and establish tight upper bounds on its excess risk with respect to a convex loss funct...
178
click to vote
NIPS
2001
15 years 7 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
169
click to vote
VISSYM
2003
15 years 7 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
198
click to vote
DICTA
2009
15 years 7 months ago
2009
Many state-of-the-art object recognition systems rely on identifying the location of objects in images, in order to better learn its visual attributes. In this paper, we propose fo...
157
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
The concept of Statistical Resolution Limit (SRL), which is defined as the minimal separation to resolve two closely spaced signals, is an important tool to quantify performance ...