Sciweavers

2473 search results - page 74 / 495
» The Logic of Communication Graphs
Sort
View
SC
1993
ACM
13 years 11 months ago
Runtime compilation techniques for data partitioning and communication schedule reuse
In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations e ectively. The rst mechanism invokes a user speci ed mapping procedure via a s...
Ravi Ponnusamy, Joel H. Saltz, Alok N. Choudhary
PODC
2010
ACM
13 years 11 months ago
Brief announcement: exponential speed-up of local algorithms using non-local communication
We demonstrate how to leverage a system’s capability for allto-all communication to achieve an exponential speed-up of local algorithms despite bandwidth and memory restrictions...
Christoph Lenzen, Roger Wattenhofer
GI
2004
Springer
14 years 1 months ago
Communicating Agents Architecture with Applications in Multimodal Human Computer Interaction
: We present our idea of solving parts of the vision task with an organic computing approach. We have designed a multiagent system (MAS) of many different modules working on differ...
Maximilian Krüger, Achim Schäfer, Andrea...
INFOCOM
2003
IEEE
14 years 1 months ago
Sampling Biases in IP Topology Measurements
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
Anukool Lakhina, John W. Byers, Mark Crovella, Pen...
GLVLSI
2007
IEEE
167views VLSI» more  GLVLSI 2007»
14 years 2 months ago
A new approach to logic synthesis of multi-output boolean functions on pal-based CPLDS
A PAL-based logic block is the core of great majority of contemporary CPLD devices. The purpose of the paper is to present a new approach to multi-level synthesis for PAL-based CP...
Dariusz Kania