Sciweavers

2487 search results - page 183 / 498
» cases 2009
Sort
View
112
Voted
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
15 years 7 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità
ASIACRYPT
2009
Springer
15 years 7 months ago
Secure Two-Party Computation Is Practical
Abstract. Secure multi-party computation has been considered by the cryptographic community for a number of years. Until recently it has been a purely theoretical area, with few im...
Benny Pinkas, Thomas Schneider, Nigel P. Smart, St...
93
Voted
BICOB
2009
Springer
15 years 7 months ago
Association Analysis Techniques for Bioinformatics Problems
Association analysis is one of the most popular analysis paradigms in data mining. Despite the solid foundation of association analysis and its potential applications, this group o...
Gowtham Atluri, Rohit Gupta, Gang Fang, Gaurav Pan...
99
Voted
CANS
2009
Springer
121views Cryptology» more  CANS 2009»
15 years 7 months ago
On Cryptographic Schemes Based on Discrete Logarithms and Factoring
Abstract. At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N. W...
Marc Joye
218
Voted
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
15 years 7 months ago
Two for One: Tight Approximation of 2D Bin Packing
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz