Sciweavers

4934 search results - page 156 / 987
» complexity 2008
Sort
View
IPL
2008
78views more  IPL 2008»
15 years 4 months ago
Resource-bounded measure on probabilistic classes
We extend Lutz's resource-bounded measure to probabilistic classes, and obtain notions of resource-bounded measure on probabilistic complexity classes such as BPE and BPEXP. ...
Philippe Moser
TIT
1998
70views more  TIT 1998»
15 years 4 months ago
The Importance of Convexity in Learning with Squared Loss
We show that if the closureof a function class F under the metric induced by some probability distribution is not convex, then the sample complexity for agnostically learning F wi...
Wee Sun Lee, Peter L. Bartlett, Robert C. Williams...
DISOPT
2008
74views more  DISOPT 2008»
15 years 4 months ago
George B. Dantzig and systems optimization
We pay homage to George B. Dantzig by describing a less well known part of his legacy--his early and dedicated championship of the importance of systems optimization in solving co...
Philip E. Gill, Walter Murray, Michael A. Saunders...
IJNSEC
2008
128views more  IJNSEC 2008»
15 years 4 months ago
Attacking LCCC Batch Verification of RSA Signatures
Batch verification of digital signatures is used to improve the computational complexity when a large number of digital signatures must be verified. Lee at al. [2] proposed a new ...
Martin Stanek
DAM
2007
77views more  DAM 2007»
15 years 4 months ago
Decompositions of graphs of functions and fast iterations of lookup tables
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
Boaz Tsaban