Sciweavers

4047 search results - page 69 / 810
» The Discrete Basis Problem
Sort
View
MP
1998
109views more  MP 1998»
13 years 9 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 10 months ago
Finding low-weight polynomial multiples using discrete logarithm
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
Frédéric Didier, Yann Laigle-Chapuy
TSMC
2008
100views more  TSMC 2008»
13 years 9 months ago
Synchronization and State Estimation for Discrete-Time Complex Networks With Distributed Delays
Abstract--In this paper, a synchronization problem is investigated for an array of coupled complex discrete-time networks with the simultaneous presence of both the discrete and di...
Yurong Liu, Zidong Wang, Jinling Liang, Xiaohui Li...
ICCAD
2009
IEEE
161views Hardware» more  ICCAD 2009»
13 years 7 months ago
The epsilon-approximation to discrete VT assignment for leakage power minimization
As VLSI technology reaches 45nm technology node, leakage power optimization has become a major design challenge. Threshold voltage (vt) assignment has been extensively studied, du...
Yujia Feng, Shiyan Hu
SCN
2004
Springer
123views Communications» more  SCN 2004»
14 years 3 months ago
On the Key Exposure Problem in Chameleon Hashes
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction employs a c...
Giuseppe Ateniese, Breno de Medeiros