683 search results - page 15 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
A hyper-heuristic performs search over a set of other search mechanisms. During the search, it does not require any problem-dependent data. This structure makes hyperheuristics pro...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...
P2P
2006
IEEE
14 years 1 months ago
2006
IEEE
We describe the problem of data dissemination in stream-oriented applications where the required filter is a function of the current state. We call such functions dynamic filter...