1790 search results - page 7 / 358 » Noise in Bilinear Problems |
JGO
2010
13 years 2 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper, we propose a simple and effective scheme for screen image scaling, targeting at real-time applications like remote desktop and screen sharing. To balance visual qua...
EUROCRYPT
2010
Springer
14 years 17 days ago
2010
Springer
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
MDAI
2005
Springer
14 years 1 months ago
2005
Springer
The purpose of this paper is to introduce pairing over elliptic curve and apply it to ID based key agreement schemes and privacy preserving key agreement schemes. The key words her...