16404 search results - page 550 / 3281 » A set coverage problem |
213
click to vote
SIAMCO
2011
15 years 1 months ago
2011
We study properties of solutions to fully nonlinear versions of the standard Black– Scholes partial differential equation. These equations have been introduced in financial mat...
233
click to vote
ALT
2011
Springer
14 years 7 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
172
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
189
click to vote
ACCV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
171
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. For deterministic tree automata, classical hierarchies, like MostowskiRabin (or index) hierarchy, Borel hierarchy, or Wadge hierarchy, are known to be decidable. However,...