Sciweavers

463 search results - page 1 / 93
» A General Framework for Graph Sparsification
Sort
View
CORR
2010
Springer
176views Education» more  CORR 2010»
13 years 4 months ago
A General Framework for Graph Sparsification
Given a weighted graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtain a...
Ramesh Hariharan, Debmalya Panigrahi
ICDM
2009
IEEE
152views Data Mining» more  ICDM 2009»
13 years 2 months ago
A Sparsification Approach for Temporal Graphical Model Decomposition
Temporal causal modeling can be used to recover the causal structure among a group of relevant time series variables. Several methods have been developed to explicitly construct te...
Ning Ruan, Ruoming Jin, Victor E. Lee, Kun Huang
ACTA
2005
101views more  ACTA 2005»
13 years 4 months ago
A general framework for types in graph rewriting
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
Barbara König
PAMI
2007
154views more  PAMI 2007»
13 years 4 months ago
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
EURODAC
1994
IEEE
129views VHDL» more  EURODAC 1994»
13 years 9 months ago
A general state graph transformation framework for asynchronous synthesis
Abstract -- A general framework for synthesis of asynchronous control circuits at the state graph level is proposed. The framework can consider both concurrency reduction as well a...
Bill Lin, Chantal Ykman-Couvreur, Peter Vanbekberg...