Sciweavers

1401 search results - page 171 / 281
» Randomness in Interactive Proofs
Sort
View
RSA
2008
103views more  RSA 2008»
14 years 9 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav
CORR
2010
Springer
134views Education» more  CORR 2010»
14 years 8 months ago
The LASSO risk for gaussian matrices
We consider the problem of learning a coefficient vector x0 ∈ RN from noisy linear observation y = Ax0 + w ∈ Rn . In many contexts (ranging from model selection to image proce...
Mohsen Bayati, Andrea Montanari
ASIACRYPT
2010
Springer
14 years 8 months ago
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
Sarah Meiklejohn, Hovav Shacham, David Mandell Fre...
WEBI
2010
Springer
14 years 7 months ago
Stochastic Simulation of Web Users
A biologically inspired cognitive model is presented for human decision making and applied to the simulation of the web user. The model is based on the Neurophysiology description ...
Pablo E. Román, Juan D. Velásquez
ICCV
2009
IEEE
14 years 7 months ago
Learning with dynamic group sparsity
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas