1671 search results - page 272 / 335 » On the Covering Steiner Problem |
CSB
2004
IEEE
15 years 3 months ago
2004
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
CHES
2006
Springer
15 years 3 months ago
2006
Springer
In recent years, some countermeasures against Differential Power Analysis (DPA) at the logic level have been proposed. At CHES 2005 conference, Popp and Mangard proposed a new coun...
113
click to vote
CIVR
2006
Springer
15 years 3 months ago
2006
Springer
We propose a novel Bayesian learning framework of hierarchical mixture model by incorporating prior hierarchical knowledge into concept representations of multi-level concept struc...
107
click to vote
DAGM
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
101
click to vote
ESORICS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Mix networks are a popular mechanism for anonymous Internet communications. By routing IP traffic through an overlay chain of mixes, they aim to hide the relationship bet...