2497 search results - page 126 / 500 » Requirements for models of achievable routing |
118
Voted
TPDS
2008
15 years 1 months ago
2008
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
130
Voted
CVPR
2007
IEEE
16 years 3 months ago
2007
IEEE
In order to achieve seamless imagery in a planar multiprojector display, geometric distortions and misalignment of images within and across projectors have to be removed. Camera-b...
109
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
—The problem of security against packet timing based traffic analysis in wireless networks is considered in this work. An analytical measure of “anonymity” of routes in eave...
69
Voted
AAAI
2004
15 years 3 months ago
2004
This paper addresses the question of allocating computational resources among a set of algorithms in order to achieve the best performance on a scheduling problem instance. Our pr...
112
Voted
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
The Gaussian mixture model (GMM) can approximate arbitrary probability distributions, which makes it a powerful tool for feature representation and classification. However, it su...