Sciweavers

264 search results - page 28 / 53
» On Linear Cryptanalysis with Many Linear Approximations
Sort
View
ESA
2011
Springer
252views Algorithms» more  ESA 2011»
14 years 1 months ago
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane
Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in R2 . These include Tukey depth [15], O...
Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
HPDC
2000
IEEE
15 years 5 months ago
Creating Large Scale Database Servers
The BaBar experiment at the Stanford Linear Accelerator Center (SLAC) is designed to perform a high precision investigation of the decays of the B-meson produced from electron-pos...
Jacek Becla, Andrew Hanushevsky
WWW
2011
ACM
14 years 8 months ago
An expressive mechanism for auctions on the web
Auctions are widely used on the Web. Applications range from internet advertising to platforms such as eBay. In most of these applications the auctions in use are single/multi-ite...
Paul Dütting, Monika Henzinger, Ingmar Weber
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 1 months ago
Relative-Error CUR Matrix Decompositions
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
14 years 11 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein