Sciweavers

396 search results - page 53 / 80
» Odd Crossing Number Is Not Crossing Number
Sort
View
GD
1998
Springer
15 years 1 months ago
Geometric Thickness of Complete Graphs
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...
Michael B. Dillencourt, David Eppstein, Daniel S. ...
EUROSYS
2010
ACM
15 years 1 months ago
Locating cache performance bottlenecks using data profiling
Effective use of CPU data caches is critical to good performance, but poor cache use patterns are often hard to spot using existing execution profiling tools. Typical profilers at...
Aleksey Pesterev, Nickolai Zeldovich, Robert T. Mo...
MCU
1998
154views Hardware» more  MCU 1998»
14 years 11 months ago
A computation-universal two-dimensional 8-state triangular reversible cellular automaton
A reversible cellular automaton (RCA) is a cellular automaton (CA) whose global function is injective and every configuration has at most one predecessor. Margolus showed that the...
Katsunobu Imai, Kenichi Morita
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
14 years 9 months ago
The Hausdorff Voronoi Diagram of Point Clusters in the Plane
We study the Hausdorff Voronoi diagram of point clusters in the plane, a generalization of Voronoi diagrams based on the Hausdorff distance function. We derive a tight combinatori...
Evanthia Papadopoulou
ICTAI
2010
IEEE
14 years 7 months ago
An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
Una Benlic, Jin-Kao Hao