Sciweavers

4164 search results - page 364 / 833
» Timing model reduction for hierarchical timing analysis
Sort
View
CORR
2010
Springer
167views Education» more  CORR 2010»
15 years 6 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
COCOA
2008
Springer
15 years 8 months ago
Computational Study on Dominating Set Problem of Planar Graphs
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
AAAI
1997
15 years 8 months ago
Models of Continual Computation
Automated problem solving is viewed typically as the expenditure of computation to solve one or more problems passed to a reasoning system. In response to each problem received, e...
Eric Horvitz
CONCUR
2008
Springer
15 years 8 months ago
Modeling Computational Security in Long-Lived Systems
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
TODAES
2002
134views more  TODAES 2002»
15 years 6 months ago
False-noise analysis using logic implications
ct Cross-coupled noise analysis has become a critical concern in today's VLSI designs. Typically, noise analysis makes an assumption that all aggressing nets can simultaneousl...
Alexey Glebov, Sergey Gavrilov, David Blaauw, Vlad...