Sciweavers

7986 search results - page 1403 / 1598
» Computational Science and its Applications
Sort
View
WWW
2005
ACM
16 years 7 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
16 years 7 months ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
195
Voted
VLSID
2009
IEEE
139views VLSI» more  VLSID 2009»
16 years 7 months ago
Improving Scalability and Per-Core Performance in Multi-Cores through Resource Sharing and Reconfiguration
Increasing the number of cores in a multi-core processor reduces per-core performance. On the other hand, providing more resources to each core limits the number of cores on a chi...
Tameesh Suri, Aneesh Aggarwal
FSE
2009
Springer
136views Cryptology» more  FSE 2009»
16 years 7 months ago
MAC Reforgeability
Message Authentication Codes (MACs) are core algorithms deployed in virtually every security protocol in common usage. In these protocols, the integrity and authenticity of messag...
John Black, Martin Cochran
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 7 months ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous
« Prev « First page 1403 / 1598 Last » Next »