186 search results - page 15 / 38 » Categorical Views on Computations on Trees (Extended Abstrac... |
112
click to vote
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
ICPPW
2002
IEEE
15 years 4 months ago
2002
IEEE
Incidents such as Solar Sunrise and Nimda demonstrate the need to expressively model distributed and complex network attacks. To protect information systems, system administrators...
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
Random Forests (RFs) have become commonplace
in many computer vision applications. Their
popularity is mainly driven by their high computational
efficiency during both training ...
CP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
WOB
2004
15 years 1 months ago
2004
ABSTRACT. The computationally challenging problem of reconstructing the phylogeny of a set of contemporary data, such as DNA sequences or morphological attributes, was treated by a...