Sciweavers

27692 search results - page 208 / 5539
» Where is ...
Sort
View
CPM
2004
Springer
120views Combinatorics» more  CPM 2004»
14 years 3 months ago
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
ESA
2004
Springer
106views Algorithms» more  ESA 2004»
14 years 3 months ago
Stable Minimum Storage Merging by Symmetric Comparisons
We introduce a new stable minimum storage algorithm for merging that needs O(m log( n m + 1)) element comparisons, where m and n are the sizes of the input sequences with m ≤ n. ...
Pok-Son Kim, Arne Kutzner
GECCO
2004
Springer
108views Optimization» more  GECCO 2004»
14 years 3 months ago
The Incremental Pareto-Coevolution Archive
Coevolution can in principle provide progress for problems where no accurate evaluation function is available. An important open question however is how coevolution can be set up s...
Edwin D. de Jong
ICA
2004
Springer
14 years 3 months ago
Soft-LOST: EM on a Mixture of Oriented Lines
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...
Paul D. O'Grady, Barak A. Pearlmutter
ICALP
2004
Springer
14 years 3 months ago
Easily Refutable Subformulas of Large Random 3CNF Formulas
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...
Uriel Feige, Eran Ofek