Sciweavers

104 search results - page 13 / 21
» Tight Bounds for Point Recolouring
Sort
View
COMPGEOM
2008
ACM
14 years 11 months ago
Consistent digital rays
Given a fixed origin o in the d-dimensional grid, we give a novel definition of digital rays dig(op) from o to each grid point p. Each digital ray dig(op) approximates the Euclide...
Jinhee Chun, Matias Korman, Martin Nöllenburg...
88
Voted
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
15 years 3 months ago
On Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar ...
RSA
2010
94views more  RSA 2010»
14 years 8 months ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder
GD
2009
Springer
15 years 2 months ago
Drawing Hamiltonian Cycles with No Large Angles
Let n ≥ 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n str...
Adrian Dumitrescu, János Pach, Géza ...
MICRO
2003
IEEE
106views Hardware» more  MICRO 2003»
15 years 2 months ago
Single-ISA Heterogeneous Multi-Core Architectures: The Potential for Processor Power Reduction
This paper proposes and evaluates single-ISA heterogeneous multi-core architectures as a mechanism to reduce processor power dissipation. Our design incorporates heterogeneous cor...
Rakesh Kumar, Keith I. Farkas, Norman P. Jouppi, P...