523 search results - page 32 / 105 » On the Signal Bounding Problem in Timing Analysis |
129
click to vote
ANTS
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
105
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
This work considers the problem of quickest detection with N distributed sensors that receive sequential observations either in discrete or in continuous time from the environment....
104
click to vote
CIAC
1997
Springer
15 years 5 months ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
112
click to vote
ISCAS
2007
IEEE
15 years 7 months ago
2007
IEEE
—CMOS radio receiver architectures, based on radio frequency (RF) sampling followed by discrete-time (D-T) signal processing via switched-capacitor circuits, have recently been p...
129
click to vote
ICCAD
1999
IEEE
15 years 5 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...