16430 search results - page 307 / 3286 » On Computable Tree Functions |
149
click to vote
CHES
2007
Springer
15 years 11 months ago
2007
Springer
Replay attacks are often the most costly attacks to thwart when dealing with off-chip memory integrity. With a trusted System-on-Chip, the existing countermeasures against replay r...
182
click to vote
HUMO
2007
Springer
15 years 11 months ago
2007
Springer
Tree-structured models have been widely used for human pose estimation, in either 2D or 3D. While such models allow efficient learning and inference, they fail to capture additiona...
148
click to vote
NBIS
2007
Springer
15 years 11 months ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
140
click to vote
SOFSEM
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
150
click to vote
CCECE
2006
IEEE
15 years 11 months ago
2006
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...