Sciweavers

148 search results - page 9 / 30
» DisNet: A Framework for Distributed Graph Computation
Sort
View
CSJM
2006
76views more  CSJM 2006»
14 years 9 months ago
Graph Coloring using Peer-to-Peer Networks
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availabili...
Adrian Iftene, Cornelius Croitoru
GG
2010
Springer
14 years 10 months ago
A Component Concept for Typed Graphs with Inheritance and Containment Structures
Model-driven development (MDD) has become a promising trend in software engineering. The model-driven development of highly complex software systems may lead to large models which ...
Stefan Jurack, Gabriele Taentzer
75
Voted
STACS
2010
Springer
15 years 4 months ago
Evasiveness and the Distribution of Prime Numbers
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
László Babai, Anandam Banerjee, Ragh...
CVPR
2008
IEEE
15 years 11 months ago
Distributed data association and filtering for multiple target tracking
This paper presents a novel distributed framework for multi-target tracking with an efficient data association computation. A decentralized representation of trackers' motion...
Ting Yu, Ying Wu, Nils Krahnstoever, Peter H. Tu
IPPS
2006
IEEE
15 years 3 months ago
A simulator for parallel applications with dynamically varying compute node allocation
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. We introduce the concept of dynamic ef...
Basile Schaeli, B. Gerlach, Roger D. Hersch