Sciweavers

100 search results - page 20 / 20
» Estimating the Average of a Lipschitz-Continuous Function fr...
Sort
View
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
14 years 5 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
ASPDAC
2006
ACM
120views Hardware» more  ASPDAC 2006»
13 years 11 months ago
A novel framework for multilevel full-chip gridless routing
— Due to its great flexibility, gridless routing is desirable for nanometer circuit designs that use variable wire widths and spacings. Nevertheless, it is much more difficult ...
Tai-Chen Chen, Yao-Wen Chang, Shyh-Chang Lin
TSP
2010
12 years 12 months ago
Variance-component based sparse signal reconstruction and model selection
We propose a variance-component probabilistic model for sparse signal reconstruction and model selection. The measurements follow an underdetermined linear model, where the unknown...
Kun Qiu, Aleksandar Dogandzic
PROFES
2004
Springer
13 years 10 months ago
Using a Reference Application with Design Patterns to Produce Industrial Software
Abstract. System architectures are described in abstract terms, often using Design Patterns. Actual reuse based on such descriptions requires that each development project derive a...
Marek Vokác, Oluf Jensen
INFOCOM
2000
IEEE
13 years 8 months ago
A Predictability Analysis of Network Traffic
This paper assesses the predictability of network traffic by considering two metrics: (1) how far into the future a traffic rate process can be predicted with bounded error; (2) w...
Aimin Sang, San-qi Li