Sciweavers

463 search results - page 35 / 93
» A General Framework for Graph Sparsification
Sort
View
DLOG
2009
13 years 5 months ago
Testing Provers on a Grid - Framework Description
Abstract. GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests locally, in a single computer, or in a comput...
Carlos Areces, Daniel Gorín, Alejandra Lore...
MODELS
2009
Springer
14 years 2 months ago
Towards Composite Model Transformations Using Distributed Graph Transformation Concepts
Model-based development of highly complex software systems leads to large models. Storing them in repositories offers the possibility to work with these models in a distributed env...
Stefan Jurack, Gabriele Taentzer
PKDD
2009
Springer
120views Data Mining» more  PKDD 2009»
14 years 2 months ago
Variational Graph Embedding for Globally and Locally Consistent Feature Extraction
Existing feature extraction methods explore either global statistical or local geometric information underlying the data. In this paper, we propose a general framework to learn fea...
Shuang-Hong Yang, Hongyuan Zha, Shaohua Kevin Zhou...
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 10 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
MFCS
2007
Springer
14 years 1 months ago
Traces of Term-Automatic Graphs
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
Antoine Meyer