Sciweavers

2027 search results - page 21 / 406
» When is it best to best-respond
Sort
View
EUROCRYPT
2000
Springer
14 years 1 months ago
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard ove...
Nicolas Courtois, Alexander Klimov, Jacques Patari...
CHI
2010
ACM
14 years 12 days ago
ContraVision: presenting contrasting visions of future technology
How can we best explore the range of users' reactions when developing future technologies that may be controversial, such as personal healthcare systems? Our approach
Blaine A. Price, Clara Mancini, Yvonne Rogers, Aro...
ORL
2006
114views more  ORL 2006»
13 years 10 months ago
A (1-1/e)-approximation algorithm for the generalized assignment problem
We give a (1 - 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every ...
Zeev Nutov, Israel Beniaminy, Raphael Yuster
DATASCIENCE
2007
74views more  DATASCIENCE 2007»
13 years 9 months ago
The relative efficiency of data compression by LZW and LZSS
We explore the use of the LZW and LZSS data compression methods. These methods or some versions of them are very common in use of compressing different types of data. Even though ...
Yair Wiseman
CGO
2004
IEEE
14 years 1 months ago
A Dynamically Tuned Sorting Library
Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that del...
Xiaoming Li, María Jesús Garzar&aacu...