1623 search results - page 115 / 325 » No Sorting |
160
click to vote
CADE
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
116
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...
112
click to vote
DCC
2005
IEEE
16 years 4 months ago
2005
IEEE
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
134
click to vote
ISQED
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper we propose a technique to determine accurate interconnect extraction corners for a 65-nm design using parametric RC extraction and timing analysis. We calculate the ...
127
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
—In this paper, we introduce NNexus, a generalization of the automatic linking engine of Noosphere (at PlanetMath.org) and the first system that automates the process of linking...