14078 search results - page 384 / 2816 » Design and Analysis of Computer Algorithms |
167
click to vote
IMR
1998
Springer
15 years 11 months ago
1998
Springer
In this paper we introduce and discuss a graph structure associated with longest-edge algorithms (algorithms based on the bisection of triangles by the longest-edge) which can be u...
200
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g. due to environmental radiation. Approaches to implement fault tol...
172
click to vote
COMPGEOM
1999
ACM
15 years 11 months ago
1999
ACM
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
162
click to vote
LCN
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper studies the optimal configuration of virtual paths in ATM networks. A linear model that minimizes the mrximumjow density of links is proposed for the optimal virtual pa...
177
click to vote
ICCAD
1993
IEEE
15 years 11 months ago
1993
IEEE
In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depth-optimal FlowMap algorithm. The new algorithm, na...