Sciweavers

523 search results - page 34 / 105
» On the Signal Bounding Problem in Timing Analysis
Sort
View
STOC
2003
ACM
96views Algorithms» more  STOC 2003»
16 years 1 months ago
Optimal oblivious routing in polynomial time
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, H...
CDC
2009
IEEE
180views Control Systems» more  CDC 2009»
15 years 4 months ago
Robustness analysis for Least Squares kernel based regression: an optimization approach
—In kernel based regression techniques (such as Support Vector Machines or Least Squares Support Vector Machines) it is hard to analyze the influence of perturbed inputs on the ...
Tillmann Falck, Johan A. K. Suykens, Bart De Moor
DATE
2002
IEEE
69views Hardware» more  DATE 2002»
15 years 6 months ago
Verifying Clock Schedules in the Presence of Cross Talk
This paper addresses verifying the timing of circuits containing level-sensitive latches in the presence of cross talk. We show that three consecutive periodic occurrences of the ...
Soha Hassoun, Eduardo Calvillo-Gámez, Chris...
COCOA
2010
Springer
14 years 11 months ago
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...
Peter Damaschke, Azam Sheikh Muhammad
TIT
2002
146views more  TIT 2002»
15 years 29 days ago
Least squares estimation of 2-D sinusoids in colored noise: Asymptotic analysis
This paper considers the problem of estimating the parameters of real-valued two-dimensional (2-D) sinusoidal signals observed in colored noise. This problem is a special case of t...
Guy Cohen, Joseph M. Francos