1421 search results - page 44 / 285 » Algorithms for subsequence combinatorics |
171
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
We study unsupervised learning of occluding objects in images of visual scenes. The derived learning algorithm is based on a probabilistic generative model which parameterizes obj...
115
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
138
click to vote
CPM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the...
128
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
212
click to vote
AB
2008
Springer
15 years 5 months ago
2008
Springer
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...