Sciweavers

234 search results - page 20 / 47
» On Bus Graph Realizability
Sort
View
JLP
2006
81views more  JLP 2006»
13 years 7 months ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
SAC
2006
ACM
14 years 1 months ago
Supporting transparent model update in distributed CASE tool integration
Model Driven Architecture (MDA) is a software development approach that focuses on models. In order to support MDA, a lot of CASE tools have emerged; each of them provides a diffe...
Prawee Sriplakich, Xavier Blanc, Marie-Pierre Gerv...
WG
2005
Springer
14 years 26 days ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier
CORR
2012
Springer
209views Education» more  CORR 2012»
12 years 3 months ago
Densest Subgraph in Streaming and MapReduce
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii