Sciweavers

5624 search results - page 917 / 1125
» On Conditional Covering Problem
Sort
View
107
Voted
WDAG
2005
Springer
67views Algorithms» more  WDAG 2005»
15 years 8 months ago
What Can Be Implemented Anonymously?
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...
Rachid Guerraoui, Eric Ruppert
138
Voted
AOSD
2004
ACM
15 years 8 months ago
Composition, reuse and interaction analysis of stateful aspects
Aspect-Oriented Programming promises separation of concerns at the implementation level. However, aspects are not always orthogonal and aspect interaction is a fundamental problem...
Rémi Douence, Pascal Fradet, Mario Süd...
101
Voted
ASPDAC
2004
ACM
120views Hardware» more  ASPDAC 2004»
15 years 8 months ago
Temporal floorplanning using 3D-subTCG
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang, Hsin-...
96
Voted
MM
2004
ACM
98views Multimedia» more  MM 2004»
15 years 8 months ago
Coordinated multi-streaming for 3D tele-immersion
This paper looks at the problem of multi-streaming in 3D teleimmersion and describes how a protocol architecture called CP (for Coordination Protocol) can be used to coordinate vi...
David E. Ott, Ketan Mayer-Patel
118
Voted
PODC
2004
ACM
15 years 8 months ago
Computation in networks of passively mobile finite-state sensors
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
Dana Angluin, James Aspnes, Zoë Diamadi, Mich...