Sciweavers

Share
IACR
2011
112views more  IACR 2011»
7 years 9 months ago
Improved Generic Algorithms for Hard Knapsacks
At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time ˜O(20.337n ) and memory ˜O(20.256n ), thereby improvin...
Anja Becker, Jean-Sébastien Coron, Antoine ...
WSC
2000
8 years 10 months ago
Simulation output analysis via dynamic batch means
This paper is focused on estimating the quality of the sample mean from a steady-state simulation experiment with consideration of computational efficiency, memory requirement, an...
Yingchieh Yeh, Bruce W. Schmeiser
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
8 years 11 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
CAAN
2006
Springer
9 years 1 months ago
Distributed Routing in Tree Networks with Few Landmarks
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...
Ioannis Z. Emiris, Euripides Markou, Aris Pagourtz...
INFOCOM
1999
IEEE
9 years 1 months ago
The TIME-WAIT State in TCP and Its Effect on Busy Servers
Hosts providing important network services such as HTTP and FTP incur a per-connection memory load from TCP that can adversely affect their connection rate and throughput. The mem...
Theodore Faber, Joseph D. Touch, Wei Yue
CSMR
2003
IEEE
9 years 2 months ago
Moving to Smaller Libraries via Clustering and Genetic Algorithms
There may be several reasons to reduce a software system to its bare bone removing the extra fat introduced during development or evolution. Porting the software system on embedde...
Giuliano Antoniol, Massimiliano Di Penta, Markus N...
IPSN
2005
Springer
9 years 2 months ago
A key pre-distribution scheme using deployment knowledge for wireless sensor networks
— Sensor networks pose security and privacy challenges. One challenge is how to bootstrap secure communications among nodes. Several key pre-distribution schemes have been propos...
Zhen Yu, Yong Guan
CVPR
2010
IEEE
9 years 2 months ago
Fast Sparse Representation with Prototypes
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
Jia-Bin Huang, Ming-Hsuan Yang
SKG
2006
IEEE
9 years 3 months ago
Remote Memory Management and Prefetching Techniques for Jobs in Grid
Predominant resources for execution of any application are computational power and memory. On one side, computational power has grown many folds faster than memory capacity. On th...
S. Radha, S. Mary Saira Bhanu, N. P. Gopalan
PRDC
2007
IEEE
9 years 3 months ago
Improving Dependability Using Shared Supplementary Memory and Opportunistic Micro Rejuvenation in Multi-tasking Embedded Systems
We propose a comprehensive solution to handle memory-overflow problems in multitasking embedded systems thereby improving their reliability and availability. In particular, we pro...
Vinaitheerthan Sundaram, Sandip HomChaudhuri, Sach...
books