Sciweavers

948 search results - page 88 / 190
» What can we achieve by arbitrary announcements
Sort
View
DAGSTUHL
2006
13 years 11 months ago
New tricks from an old dog: An overview of TEI P5
This paper presents an update on the current state of development of the Text Encoding Initiative's Guidelines for Electronic Text Encoding and Interchange. Since the last ma...
Lou Burnard
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
14 years 7 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
CGF
2008
100views more  CGF 2008»
13 years 10 months ago
Distortion-Free Steganography for Polygonal Meshes
We present a technique for steganography in polygonal meshes. Our method hides a message in the indexed representation of a mesh by permuting the order in which faces and vertices...
Alexander Bogomjakov, Craig Gotsman, Martin Isenbu...
PIMRC
2010
IEEE
13 years 8 months ago
Efficient cooperative protocols for general outage-limited multihop wireless networks
Abstract-- Due to the limited energy supplies of nodes in wireless networks, achieving energy efficiency is crucial for extending the lifetime of these networks. Thus, we study eff...
Behrouz Maham, Walid Saad, Mérouane Debbah,...
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
13 years 5 months ago
Decomposability of global tasks for multi-agent systems
Abstract-- Multi-agent system is a rapidly developing research area with strong support from both civilian and military applications. One of the essential problems in multi-agent s...
Mohammad Karimadini, Hai Lin 0002