Sciweavers

2252 search results - page 264 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
134
Voted
DAC
2006
ACM
15 years 7 months ago
Refined statistical static timing analysis through
Statistical static timing analysis (SSTA) has been a popular research topic in recent years. A fundamental issue with applying SSTA in practice today is the lack of reliable and e...
Benjamin N. Lee, Li-C. Wang, Magdy S. Abadir
105
Voted
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 3 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap
104
Voted
TIP
2010
155views more  TIP 2010»
15 years 2 months ago
Is Denoising Dead?
—Image denoising has been a well studied problem in the field of image processing. Yet researchers continue to focus attention on it to better the current state-of-the-art. Rece...
Priyam Chatterjee, Peyman Milanfar
128
Voted
NDSS
2008
IEEE
15 years 10 months ago
Limits of Learning-based Signature Generation with Adversaries
Automatic signature generation is necessary because there may often be little time between the discovery of a vulnerability, and exploits developed to target the vulnerability. Mu...
Shobha Venkataraman, Avrim Blum, Dawn Song
WWW
2007
ACM
16 years 4 months ago
Optimized query planning of continuous aggregation queries in dynamic data dissemination networks
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Krithi Ramamritham