Sciweavers

16404 search results - page 888 / 3281
» A set coverage problem
Sort
View
WALCOM
2007
IEEE
109views Algorithms» more  WALCOM 2007»
15 years 8 months ago
Pattern Matching in Degenerate DNA/RNA Sequences
In this paper, we consider the pattern matching problem in DNA and RNA sequences where either the pattern or the text can be degenerate i.e. contain sets of characters. We present ...
M. Sohel Rahman, Costas S. Iliopoulos, Laurent Mou...
ASIAN
2009
Springer
299views Algorithms» more  ASIAN 2009»
15 years 8 months ago
Deducibility Constraints
In their work on tractable deduction systems, D. McAllester and later D. Basin and H. Ganzinger have identified a property of inference systems (the locality property) that ensures...
Sergiu Bursuc, Hubert Comon-Lundh, Stéphani...
CCCG
2009
15 years 8 months ago
Clarkson's Algorithm for Violator Spaces
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
Yves Brise, Bernd Gärtner
GECCO
2008
Springer
109views Optimization» more  GECCO 2008»
15 years 8 months ago
A tunable model for multi-objective, epistatic, rugged, and neutral fitness landscapes
The fitness landscape of a problem is the relation between the solution candidates and their reproduction probability. In order to understand optimization problems, it is essenti...
Thomas Weise, Stefan Niemczyk, Hendrik Skubch, Rol...
ICML
2010
IEEE
15 years 8 months ago
Label Ranking under Ambiguous Supervision for Learning Semantic Correspondences
This paper studies the problem of learning from ambiguous supervision, focusing on the task of learning semantic correspondences. A learning problem is said to be ambiguously supe...
Antoine Bordes, Nicolas Usunier, Jason Weston