Sciweavers

1497 search results - page 79 / 300
» A Computational Model for Message Passing
Sort
View
INFOCOM
2005
IEEE
14 years 2 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
DSN
2007
IEEE
14 years 3 months ago
How to Choose a Timing Model?
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...
Idit Keidar, Alexander Shraer
ICA
2010
Springer
13 years 9 months ago
Probabilistic Latent Tensor Factorization
We develop a probabilistic modeling framework for multiway arrays. Our framework exploits the link between graphical models and tensor factorization models and it can realize any ...
Y. Kenan Yilmaz, A. Taylan Cemgil
UAIS
2002
100views more  UAIS 2002»
13 years 9 months ago
Toward overcoming culture, skill and situation hurdles in Human-Computer Interaction
Abstract. This paper proposes a new effective strategy for designing and implementing interactive systems overcoming culture, skill and situation hurdles in HumanComputer Interacti...
Paola Carrara, Daniela Fogli, Giuseppe Fresta, Pie...
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 7 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...