Sciweavers

1551 search results - page 152 / 311
» Elastic Vector Time
Sort
View
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 6 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 6 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
ADAEUROPE
2003
Springer
15 years 9 months ago
Charles: A Data Structure Library for Ada95
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
Matthew Heaney
PODS
2008
ACM
128views Database» more  PODS 2008»
16 years 4 months ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren
CCS
2009
ACM
15 years 10 months ago
A metadata calculus for secure information sharing
In both commercial and defense sectors a compelling need is emerging for rapid, yet secure, dissemination of information to the concerned actors. Traditional approaches to informa...
Mudhakar Srivatsa, Dakshi Agrawal, Steffen Reidt