Sciweavers

379 search results - page 18 / 76
» Strong reducibility of partial numberings
Sort
View
JMLR
2010
103views more  JMLR 2010»
13 years 2 months ago
Regret Bounds and Minimax Policies under Partial Monitoring
This work deals with four classical prediction settings, namely full information, bandit, label efficient and bandit label efficient as well as four different notions of regret: p...
Jean-Yves Audibert, Sébastien Bubeck
MJ
2008
117views more  MJ 2008»
13 years 7 months ago
Efficient implementation of 3X for radix-8 encoding
Several commercial processors have selected the radix-8 multiplier architecture to increase their speed, thereby reducing the number of partial products. Radix-8 encoding reduces ...
Gustavo A. Ruiz, Mercedes Granda
HPDC
2003
IEEE
14 years 28 days ago
Flexible Information Discovery in Decentralized Distributed Systems
The ability to efficiently discover information using partial knowledge (for example keywords, attributes or ranges) is important in large, decentralized, resource sharing distri...
Cristina Schmidt, Manish Parashar
CHES
2004
Springer
167views Cryptology» more  CHES 2004»
14 years 1 months ago
Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs
Strong public-key cryptography is often considered to be too computationally expensive for small devices if not accelerated by cryptographic hardware. We revisited this statement a...
Nils Gura, Arun Patel, Arvinderpal Wander, Hans Eb...
VMCAI
2009
Springer
14 years 2 months ago
Mixed Transition Systems Revisited
—A variety of partial modeling formalisms, aimed re and reason about abstractions, have been proposed. Some, e.g., Kripke Modal Transition Systems (KMTSs) put strong restrictions...
Ou Wei, Arie Gurfinkel, Marsha Chechik