2255 search results - page 285 / 451 » Computing a Center-Transversal Line |
178
click to vote
IEEEPACT
2002
IEEE
15 years 11 months ago
2002
IEEE
Memory performance is increasingly determining microprocessor performance and technology trends are exacerbating this problem. Most architectures use set-associative caches with L...
198
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract—Packet delay traces are important measurements for analyzing end-to-end performance and for designing traffic control algorithms in computer networks. Due to the fact t...
164
Voted
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, a fault-tolerant routing in 2-D meshes with dynamic faults is provided. It is based on an early work on minimal routing in 2-D meshes with static faults. Unlike man...
158
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...
188
click to vote
GD
2001
Springer
15 years 11 months ago
2001
Springer
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which...