1986 search results - page 209 / 398 » Path Separability of Graphs |
DAC
2009
ACM
16 years 3 months ago
2009
ACM
Current compilers lack precise timing models guiding their built-in optimizations. Hence, compilers apply ad-hoc heuristics during optimization to improve code quality. One of the...
121
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
131
Voted
SIGMOD
2003
ACM
16 years 2 months ago
2003
ACM
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...
123
Voted
ICCD
2006
IEEE
15 years 11 months ago
2006
IEEE
— Accurate estimation of worst-case crosstalk effects is critical for a realistic estimation of the worst-case behavior of deep sub-micron circuits. Crosstalk analysis models usu...
151
click to vote
WADS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can...