4843 search results - page 252 / 969 » The Shortcut Problem - Complexity and Approximation |
143
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this paper, we consider the problem of manifold approximation with affine subspaces. Our objective is to discover a set of low dimensional affine subspaces that represents ma...
136
Voted
ICIP
2002
IEEE
16 years 5 months ago
2002
IEEE
The approximation of surfaces to scattered data is an important problem encountered in a variety of scientific applications, such as reverse engineering, computer vision, computer...
138
Voted
IPMI
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. We describe a new approach for estimating the posterior probability of tissue labels. Conventional likelihood models are combined with a curve length prior on boundaries,...
131
Voted
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
145
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...