5115 search results - page 958 / 1023 » On Randomized Lanczos Algorithms |
151
click to vote
CTRSA
2009
Springer
15 years 6 months ago
2009
Springer
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
128
click to vote
COCO
2004
Springer
15 years 6 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
127
Voted
COCO
2006
Springer
15 years 6 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
238
Voted
NLP
2000
15 years 6 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
126
Voted
DRR
2010
15 years 5 months ago
2010
Scaling up document-image classifiers to handle an unlimited variety of document and image types poses serious challenges to conventional trainable classifier technologies. Highly...