Sciweavers

156 search results - page 25 / 32
» pr 2007
Sort
View
APPML
2006
65views more  APPML 2006»
13 years 7 months ago
Some inequalities related to the analysis of electricity auctions
Most balancing markets of electric power are organized as uniform-price auctions. In 2001, the balancing market of England and Wales switched to a pay-as-bid auction with the inte...
Peter Hästö, Pär Holmberg
CCCG
2009
13 years 8 months ago
Every Large Point Set contains Many Collinear Points or an Empty Pentagon
We prove the following generalised empty pentagon theorem: for every integer 2, every sufficiently large set of points in the plane contains collinear points or an empty pentagon...
Zachary Abel, Brad Ballinger, Prosenjit Bose, S&ea...
PR
2008
178views more  PR 2008»
13 years 6 months ago
An effective and fast iris recognition system based on a combined multiscale feature extraction technique
The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and the various sources of intra-class varia...
Makram Nabti, Ahmed Bouridane
GI
2007
Springer
14 years 1 months ago
On Factoring Arbitrary Integers with Known Bits
: We study the factoring with known bits problem, where we are given a composite integer N = p1p2 . . . pr and oracle access to the bits of the prime factors pi, i = 1, . . . , r. ...
Mathias Herrmann, Alexander May
PKC
2007
Springer
165views Cryptology» more  PKC 2007»
14 years 1 months ago
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
Noboru Kunihiro, Kaoru Kurosawa