Sciweavers

163 search results - page 7 / 33
» Fast Edge-Routing for Large Graphs
Sort
View
TCAD
2002
98views more  TCAD 2002»
13 years 7 months ago
An Esterel compiler for large control-dominated systems
Embedded hard real-time software systems often need fine-grained parallelism and precise control of timing, things typical real-time operating systems do not provide. The Esterel l...
Stephen A. Edwards
PAKDD
2010
ACM
175views Data Mining» more  PAKDD 2010»
13 years 11 months ago
EigenSpokes: Surprising Patterns and Scalable Community Chipping in Large Graphs
Abstract. We report a surprising, persistent pattern in large sparse social graphs, which we term EigenSpokes. We focus on large Mobile Call graphs, spanning about 186K nodes and m...
B. Aditya Prakash, Ashwin Sridharan, Mukund Seshad...
SSDBM
2010
IEEE
185views Database» more  SSDBM 2010»
13 years 6 months ago
DESSIN: Mining Dense Subgraph Patterns in a Single Graph
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
Shirong Li, Shijie Zhang, Jiong Yang
ECCV
2006
Springer
14 years 9 months ago
Fast, Quality, Segmentation of Large Volumes - Isoperimetric Distance Trees
For many medical segmentation tasks, the contrast along most of the boundary of the target object is high, allowing simple thresholding or region growing approaches to provide near...
Leo Grady
ICDM
2008
IEEE
222views Data Mining» more  ICDM 2008»
14 years 2 months ago
GRAPHITE: A Visual Query System for Large Graphs
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
Duen Horng Chau, Christos Faloutsos, Hanghang Tong...