Sciweavers

2200 search results - page 259 / 440
» Bloch's Constant is Computable
Sort
View
HPCA
2003
IEEE
16 years 6 months ago
Power-Aware Control Speculation through Selective Throttling
With the constant advances in technology that lead to the increasing of the transistor count and processor frequency, power dissipation is becoming one of the major issues in high...
Juan L. Aragón, José González...
CHI
2003
ACM
16 years 6 months ago
Information voyeurism: social impact of physically large displays on information privacy
A common observation when working on physically large displays, such as wall-sized projection, is that a certain amount of information privacy is lost. A common explanation for th...
Desney S. Tan, Mary Czerwinski
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
16 years 6 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
16 years 6 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
ICALP
2009
Springer
16 years 6 months ago
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
Sudipto Guha, Zhiyi Huang