Sciweavers

2588 search results - page 51 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
13 years 1 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
CHI
1992
ACM
15 years 3 months ago
A Computational Model of Skilled Use of a Graphical User Interface
This paper describes a computational model of skilled use of a graphical user interface based on Kintsch's construction-integration theory [4, 8]. The model uses knowledge of...
Muneo Kitajima, Peter G. Polson
POPL
2008
ACM
15 years 11 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
ECCC
2010
98views more  ECCC 2010»
14 years 9 months ago
Verifying Computations with Streaming Interactive Proofs
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
Graham Cormode, Justin Thaler, Ke Yi
GIS
2010
ACM
14 years 9 months ago
Topological reasoning between complex regions in databases with frequent updates
Reasoning about space has been a considerable field of study both in Artificial Intelligence and in spatial information theory. Many applications benefit from the inference of ...
Arif Khan, Markus Schneider