463 search results - page 39 / 93 » The Most Reliable Subgraph Problem |
129
click to vote
GECCO
2000
Springer
15 years 5 months ago
2000
Springer
The success of decoder-based evolutionary algorithms (EAs) strongly depends on the achieved locality of operators and decoders. Most approaches to investigate locality properties ...
118
click to vote
ISMB
2000
15 years 3 months ago
2000
Signal nding pattern discovery in unaligned DNA sequences is a fundamental problem in both computer science and molecular biology with important applications in locating regulator...
CVIU
2008
15 years 2 months ago
2008
It is frequently remarked that designers of computer vision algorithms and systems cannot reliably predict how algorithms will respond to new problems. A variety of reasons have b...
105
click to vote
EMNLP
2009
14 years 11 months ago
2009
The ambiguity of person names in the Web has become a new area of interest for NLP researchers. This challenging problem has been formulated as the task of clustering Web search r...
134
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...