Sciweavers

2110 search results - page 313 / 422
» What is the complexity of a distributed computing system
Sort
View
ATAL
2007
Springer
15 years 10 months ago
On the robustness of preference aggregation in noisy environments
In an election held in a noisy environment, agents may unintentionally perturb the outcome by communicating faulty preferences. We investigate this setting by introducing a theore...
Ariel D. Procaccia, Jeffrey S. Rosenschein, Gal A....
MHCI
2005
Springer
15 years 10 months ago
Understanding the role of image recognition in mobile tour guides
Users of mobile tour guides often express a strong desire for the system to be able to provide information on arbitrary objects they encounter during their visit – akin to point...
Nigel Davies, Keith Cheverst, Alan J. Dix, Andre H...
CHI
2009
ACM
15 years 8 months ago
A comparison of mobile money-transfer UIs for non-literate and semi-literate users
Due to the increasing penetration of mobile phones even into poor communities, mobile payment schemes could bring formal financial services to the "unbanked". However, b...
Indrani Medhi, S. N. Nagasena Gautama, Kentaro Toy...
BIRTHDAY
2010
Springer
15 years 4 months ago
The Edge of Graph Transformation - Graphs for Behavioural Specification
The title of this paper, besides being a pun, can be taken to mean either the frontier of research in graph transformation, or the advantage of using graph transformation. To focus...
Arend Rensink
PODS
2008
ACM
128views Database» more  PODS 2008»
16 years 4 months ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren