Sciweavers

148 search results - page 21 / 30
» DisNet: A Framework for Distributed Graph Computation
Sort
View
SPAA
2006
ACM
15 years 3 months ago
On the price of heterogeneity in parallel systems
Suppose we have a parallel or distributed system whose nodes have limited capacities, such as processing speed, bandwidth, memory, or disk space. How does the performance of the s...
Brighten Godfrey, Richard M. Karp
AUSAI
2008
Springer
14 years 11 months ago
Learning a Generative Model for Structural Representations
Abstract. Graph-based representations have been used with considercess in computer vision in the abstraction and recognition of object shape and scene structure. Despite this, the ...
Andrea Torsello, David L. Dowe
JMLR
2008
94views more  JMLR 2008»
14 years 9 months ago
Using Markov Blankets for Causal Structure Learning
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
Jean-Philippe Pellet, André Elisseeff
IPPS
2006
IEEE
15 years 3 months ago
Relationships between communication models in networks using atomic registers
A distributed system is commonly modelled by a graph where nodes represent processors and there is an edge between two processors if and only if they can communicate directly. In ...
Lisa Higham, Colette Johnen
CONCUR
1998
Springer
15 years 1 months ago
Algebraic Techniques for Timed Systems
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
Albert Benveniste, Claude Jard, Stephane Gaubert