1647 search results - page 129 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
278
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
130
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents a novel two-phase stereo matching algorithm using the random walks framework. At first, a set of reliable matching pixels is extracted with prior matrices de...
207
Voted
SODA
1993
ACM
15 years 8 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
212
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
191
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...