Sciweavers

2004 search results - page 98 / 401
» Sampling from large graphs
Sort
View
DCC
2007
IEEE
16 years 2 months ago
Spectral Predictors
Many scientific, imaging, and geospatial applications produce large high-precision scalar fields sampled on a regular grid. Lossless compression of such data is commonly done usin...
Lorenzo Ibarria, Peter Lindstrom, Jarek Rossignac
BIRTHDAY
2005
Springer
15 years 8 months ago
Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
Claudia Ermel, Gabriele Taentzer, Roswitha Bardohl
EDBT
2009
ACM
132views Database» more  EDBT 2009»
15 years 9 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou
FSS
2010
147views more  FSS 2010»
15 years 1 months ago
A divide and conquer method for learning large Fuzzy Cognitive Maps
Fuzzy Cognitive Maps (FCMs) are a convenient tool for modeling and simulating dynamic systems. FCMs were applied in a large number of diverse areas and have already gained momentu...
Wojciech Stach, Lukasz A. Kurgan, Witold Pedrycz
MIDDLEWARE
2010
Springer
15 years 1 months ago
dFault: Fault Localization in Large-Scale Peer-to-Peer Systems
Distributed hash tables (DHTs) have been adopted as a building block for large-scale distributed systems. The upshot of this success is that their robust operation is even more imp...
Pawan Prakash, Ramana Rao Kompella, Venugopalan Ra...