136 search results - page 25 / 28 » Crossing and Weighted Crossing Number of Near-Planar Graphs |
GD
2005
Springer
14 years 1 months ago
2005
Springer
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
SI3D
2003
ACM
14 years 25 days ago
2003
ACM
In this paper we develop an interactive 3D browser for large topographic maps using a visual display augmented by a haptic, or force feedback, display. The extreme size of our dat...
INFOVIS
2005
IEEE
14 years 1 months ago
2005
IEEE
Cartographers have long used flow maps to show the movement of objects from one location to another, such as the number of people in a migration, the amount of goods being traded,...
EUROSYS
2010
ACM
13 years 11 months ago
2010
ACM
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...
LREC
2010
13 years 9 months ago
2010
In this work we present further development of the SpLaSH (Spoken Language Search Hawk) project. SpLaSH implements a data model for annotated speech corpora integrated with textua...