Sciweavers

5183 search results - page 277 / 1037
» The Complexity of Distributions
Sort
View
IPPS
2006
IEEE
16 years 19 days ago
An optimal approach to the task allocation problem on hierarchical architectures
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
Alexander Metzner, Martin Fränzle, Christian ...
SAG
2004
Springer
15 years 12 months ago
Modelling a Protein Structure Comparison Application on the Grid Using PROTEUS
Bioinformatics applications manage complex biological data stored into distributed and often heterogeneous databases and require large computing power. Among these, protein structu...
Mario Cannataro, Matteo Comin, Carlo Ferrari, Conc...
ICIP
2006
IEEE
16 years 8 months ago
Exploiting Spatial Redundancy in Pixel Domain Wyner-Ziv Video Coding
Distributed video coding is a recent paradigm that enables a flexible distribution of the computational complexity between the encoder and the decoder building on top of distribut...
Alan Trapanese, Catarina Brites, Fernando Pereira,...
ICDCN
2009
Springer
16 years 1 months ago
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
Amos Korman
DCOSS
2010
Springer
15 years 10 months ago
Programming Sensor Networks with State-Centric Services
This paper presents the uDSSP ("micro DSSP") programming model which simplifies the development of distributed sensor network applications that make use of complex in-net...
Andreas Lachenmann, Ulrich Müller, Robert Sug...