Sciweavers

557 search results - page 109 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
79
Voted
COMPGEOM
2004
ACM
15 years 4 months ago
Single-strip triangulation of manifolds with arbitrary topology
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
David Eppstein, M. Gopi
ESA
1993
Springer
109views Algorithms» more  ESA 1993»
15 years 3 months ago
Optimal Upward Planarity Testing of Single-Source Digraphs
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...
Paola Bertolazzi, Giuseppe Di Battista, Carlo Mann...
ASUNAM
2011
IEEE
13 years 11 months ago
MultiAspectForensics: Pattern Mining on Large-Scale Heterogeneous Networks with Tensor Analysis
—Modern applications such as web knowledge base, network traffic monitoring and online social networks have made available an unprecedented amount of network data with rich type...
Koji Maruhashi, Fan Guo, Christos Faloutsos
TOG
2012
215views Communications» more  TOG 2012»
13 years 1 months ago
Videoscapes: exploring sparse, unstructured video collections
The abundance of mobile devices and digital cameras with video capture makes it easy to obtain large collections of video clips that contain the same location, environment, or eve...
James Tompkin, Kwang In Kim, Jan Kautz, Christian ...
SOSP
2009
ACM
15 years 7 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...