Sciweavers

450 search results - page 49 / 90
» Algorithmic uses of the Feferman-Vaught Theorem
Sort
View
CTRSA
2009
Springer
127views Cryptology» more  CTRSA 2009»
14 years 3 months ago
Securing RSA against Fault Analysis by Double Addition Chain Exponentiation
Abstract. Fault Analysis is a powerful cryptanalytic technique that enables to break cryptographic implementations embedded in portable devices more efficiently than any other tech...
Matthieu Rivain
JACM
2006
134views more  JACM 2006»
13 years 8 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
ICML
2009
IEEE
14 years 9 months ago
Generalization analysis of listwise learning-to-rank algorithms
This paper presents a theoretical framework for ranking, and demonstrates how to perform generalization analysis of listwise ranking algorithms using the framework. Many learning-...
Yanyan Lan, Tie-Yan Liu, Zhiming Ma, Hang Li
PDCN
2004
13 years 10 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
GRAPHITE
2004
ACM
14 years 2 months ago
Dual space drawing methods for cones
Ruled surface design and its applications are widely used in CAGD (Computer Aid Geometric Design) and industrial areas. In this paper, the cone is a particular ruled surface, whic...
Rena Ding, Yan Zhang