Sciweavers

3958 search results - page 136 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
186
Voted
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
15 years 4 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
CSB
2005
IEEE
163views Bioinformatics» more  CSB 2005»
15 years 12 months ago
A symbolic approach to the simulation of biochemical models: application to circadian rhythms
Symbolic rewriting systems are gaining interest as tools for simulating biochemical dynamics. Compared to traditional methods based on differential equations, the symbolic approac...
Federico Fontana, Luca Bianco, Vincenzo Manca
ICPP
1999
IEEE
15 years 10 months ago
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
PVLDB
2010
151views more  PVLDB 2010»
15 years 4 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
Kathy Macropol, Ambuj K. Singh
VLC
2002
93views more  VLC 2002»
15 years 6 months ago
Metrics for Graph Drawing Aesthetics
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
Helen C. Purchase