Sciweavers

17967 search results - page 327 / 3594
» Functional timing optimization
Sort
View
MST
2010
98views more  MST 2010»
15 years 5 months ago
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Abstract. We investigate the effect of linear independence in the strategies of congestion games on the convergence time of best improvement sequences and on the pure Price of Anar...
Dimitris Fotakis
ICIP
2006
IEEE
16 years 8 months ago
Sparse Image Reconstruction for Partially known Blur Functions
In this paper, we consider the problem of image reconstruction from the noisy blurred version of an original image when the blurring operator is partially known and the original i...
Raviv Raich, Alfred O. Hero
JMLR
2010
103views more  JMLR 2010»
15 years 1 months ago
Learning Nonlinear Dynamic Models from Non-sequenced Data
Virtually all methods of learning dynamic systems from data start from the same basic assumption: the learning algorithm will be given a sequence of data generated from the dynami...
Tzu-Kuo Huang, Le Song, Jeff Schneider
DCC
2002
IEEE
16 years 6 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
136
Voted
ASIACRYPT
2004
Springer
16 years 3 days ago
On Provably Secure Time-Stamping Schemes
Abstract. It is almost a folklore-knowledge that hash-based time-stamping schemes are secure if the underlying hash function is collisionresistant but still no rigorous proofs have...
Ahto Buldas, Märt Saarepera