3874 search results - page 269 / 775 » Approximation Algorithms for k-hurdle Problems |
145
click to vote
IPMI
2007
Springer
16 years 5 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,...
139
click to vote
GECCO
2009
Springer
15 years 11 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...
156
click to vote
WAOA
2005
Springer
15 years 10 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
121
click to vote
SPIRE
1999
Springer
15 years 8 months ago
1999
Springer
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
121
click to vote
CAGD
2004
15 years 4 months ago
2004
Topologically consistent algorithms for the intersection and trimming of free-form parametric surfaces are of fundamental importance in computer-aided design, analysis, and manufa...