Sciweavers

948 search results - page 50 / 190
» Self-Similar Algorithms for Dynamic Distributed Systems
Sort
View
UAI
2004
13 years 10 months ago
Bayesian Learning in Undirected Graphical Models: Approximate MCMC Algorithms
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
Iain Murray, Zoubin Ghahramani
ICDCS
2010
IEEE
14 years 26 days ago
Divide and Conquer Algorithms for Publish/Subscribe Overlay Design
Abstract—Overlay network design for topic-based publish/subscribe systems is of primary importance because the overlay directly impacts the system’s performance. Determining a ...
Chen Chen, Hans-Arno Jacobsen, Roman Vitenberg
ASPDAC
2005
ACM
98views Hardware» more  ASPDAC 2005»
13 years 11 months ago
Online hardware/software partitioning in networked embedded systems
Abstract— Today’s embedded systems are typically distributed and more often confronted with timevarying demands. Existing methodologies that optimize the partitioning of comput...
Thilo Streichert, Christian Haubelt, Jürgen T...
SPAA
1994
ACM
14 years 1 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
HPCN
1995
Springer
14 years 15 days ago
Exploiting high performance Fortran for computational fluid dynamics
Abstract. We discuss the High Performance Fortran data parallel programming language as an aid to software engineering and as a tool for exploiting High Performance Computing syste...
Kenneth A. Hawick, Geoffrey Fox