1855 search results - page 164 / 371 » A coding theorem for distributed computation |
142
Voted
DSOM
2000
Springer
15 years 7 months ago
2000
Springer
In recent years, a significant amount of research work has addressed the use of code mobility in network management. In this paper, we introduce first three aspects of code mobilit...
124
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
131
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper we perform 3D face tracking on corrupted video sequences. We use a deformable model, combined with a predictive filter, to recover both the rigid transformations and...
127
Voted
ICPP
2005
IEEE
15 years 9 months ago
2005
IEEE
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
198
click to vote
CONCUR
2001
Springer
15 years 8 months ago
2001
Springer
In order to model the behaviour of open concurrent systems by means of Petri nets, we introduce open Petri nets, a generalization of the ordinary model where some places, designate...