Sciweavers

2434 search results - page 171 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
TCC
2012
Springer
226views Cryptology» more  TCC 2012»
13 years 11 months ago
On the Instantiability of Hash-and-Sign RSA Signatures
The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the o...
Yevgeniy Dodis, Iftach Haitner, Aris Tentes
CORR
2010
Springer
110views Education» more  CORR 2010»
15 years 4 months ago
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics
We study logit dynamics [3] for strategic games. At every stage of the game a player is selected uniformly at random and she is assumed to play according to a noisy best-response ...
Vincenzo Auletta, Diodato Ferraioli, Francesco Pas...
190
Voted
ICALP
2011
Springer
14 years 7 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
CVPR
2010
IEEE
16 years 9 days ago
Segmenting Video Into Classes of Algorithm-Suitability
Given a set of algorithms, which one(s) should you apply to, i) compute optical flow, or ii) perform feature matching? Would looking at the sequence in question help you decide? I...
Oisin Mac Aodha, Gabriel Brostow, marc Pollefeys
GLOBECOM
2006
IEEE
15 years 10 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang