Sciweavers

1686 search results - page 259 / 338
» Programs as polygraphs: computability and complexity
Sort
View
118
Voted
CLUSTER
2006
IEEE
15 years 26 days ago
Optimizing MPI collective communication by orthogonal structures
Many parallel applications from scientific computing use MPI collective communication operations to collect or distribute data. Since the execution times of these communication op...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
JEI
1998
94views more  JEI 1998»
15 years 15 days ago
Proximity sensing with wavelet-generated video
In this paper we introduce wavelet video processing of proximity sensor signals. Proximity sensing is required for a wide range of military and commercial applications, including w...
Steven Noel, Harold Szu
113
Voted
LATIN
2010
Springer
14 years 11 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen
TMC
2010
130views more  TMC 2010»
14 years 11 months ago
SYNAPSE++: Code Dissemination in Wireless Sensor Networks Using Fountain Codes
—This paper presents SYNAPSE++, a system for over the air reprogramming of wireless sensor networks (WSNs). In contrast to previous solutions, which implement plain negative ackn...
Michele Rossi, Nicola Bui, Giovanni Zanca, Luca St...
WDAG
2010
Springer
185views Algorithms» more  WDAG 2010»
14 years 11 months ago
Leader Election Problem versus Pattern Formation Problem
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead...
Yoann Dieudonné, Franck Petit, Vincent Vill...