Sciweavers

50 search results - page 7 / 10
» Graph Drawing and Manipulation with LINK
Sort
View
IAAI
2003
13 years 9 months ago
LAW: A Workbench for Approximate Pattern Matching in Relational Data
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
Michael Wolverton, Pauline Berry, Ian W. Harrison,...
TOG
2012
193views Communications» more  TOG 2012»
11 years 10 months ago
Selectively de-animating video
We present a semi-automated technique for selectively deanimating video to remove the large-scale motions of one or more objects so that other motions are easier to see. The user ...
Jiamin Bai, Aseem Agarwala, Maneesh Agrawala, Ravi...
GD
2003
Springer
14 years 24 days ago
Radial Level Planarity Testing and Embedding in Linear Time
A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity ...
Christian Bachmaier, Franz-Josef Brandenburg, Mich...
VLDB
2005
ACM
177views Database» more  VLDB 2005»
14 years 1 months ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
KES
2010
Springer
13 years 6 months ago
Extracting a Keyword Network of Flood Disaster Measures
For rapid and effective recovery from a flood disaster, an anti-disaster headquarters must not only assess the extent of damage, but also possess overall knowledge of the possibl...
Motoki Miura, Mitsuhiro Tokuda, Daiki Kuwahara