3320 search results - page 193 / 664 » Heuristics for the Phylogeny Problem |
220
click to vote
SIGIR
2012
ACM
13 years 9 months ago
2012
ACM
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
192
Voted
ICCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
285
click to vote
CVPR
2012
IEEE
13 years 12 months ago
2012
IEEE
Learning from streams of evolving and unbounded data is an important problem, for example in visual surveillance or internet scale data. For such large and evolving real-world data...
158
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NPhard. This work presents a new iterated local search to s...
161
click to vote
CRYPTO
2005
Springer
16 years 5 days ago
2005
Springer
In this paper we present a practical heuristic attack on the Ko, Lee et al. key exchange protocol introduced at Crypto 2000 [10]. One of the ideas behind our attack is using Dehorn...