Sciweavers

396 search results - page 54 / 80
» Crossing Numbers
Sort
View
GD
1998
Springer
13 years 11 months ago
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
GD
1998
Springer
13 years 11 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
13 years 11 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»
13 years 8 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
ICNP
2009
IEEE
13 years 5 months ago
Memory Efficient Protocols for Detecting Node Replication Attacks in Wireless Sensor Networks
Sensor networks deployed in hostile areas are subject to node replication attacks, in which an adversary compromises a few sensors, extracts the security keys, and clones them in a...
Ming Zhang, Vishal Khanapure, Shigang Chen, Xuelia...