Sciweavers

17760 search results - page 175 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
127
Voted
AES
2000
Springer
98views Cryptology» more  AES 2000»
15 years 8 months ago
How Well Are High-End DSPs Suited for the AES Algorithms? AES Algorithms on the TMS320C6x DSP
The National Institute of Standards and Technology (NIST) has announced that one of the design criteria for the Advanced Encryption Standard (AES) algorithm was the ability to eï¬...
Thomas J. Wollinger, Min Wang, Jorge Guajardo, Chr...
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 7 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
113
Voted
STOC
2006
ACM
117views Algorithms» more  STOC 2006»
15 years 10 months ago
Pseudorandom walks on regular digraphs and the RL vs. L problem
We revisit the general RL vs. L question, obtaining the following results.
Omer Reingold, Luca Trevisan, Salil P. Vadhan
TSMC
2002
102views more  TSMC 2002»
15 years 3 months ago
Generalized pursuit learning schemes: new families of continuous and discretized learning automata
The fastest learning automata (LA) algorithms currently available fall in the family of estimator algorithms introduced by Thathachar and Sastry [24]. The pioneering work of these ...
M. Agache, B. John Oommen
FOCS
2008
IEEE
15 years 10 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer