Sciweavers

1568 search results - page 131 / 314
» The problem of examination questions in algorithmics
Sort
View
WISEC
2009
ACM
15 years 11 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
CMMR
2007
Springer
174views Music» more  CMMR 2007»
15 years 10 months ago
Between Mapping, Sonification and Composition: Responsive Audio Environments in Live Performance
This paper describes recent work on a large-scale, interactive theater performance entitled Schwelle as a platform to pose critical questions around the conception, design and imp...
Christopher L. Salter, Marije A. J. Baalman, Danie...
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
15 years 11 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
PODC
2009
ACM
16 years 5 months ago
Randomized mutual exclusion in O(log N / log log N) RMRs
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
Danny Hendler, Philipp Woelfel
ISSS
1995
IEEE
100views Hardware» more  ISSS 1995»
15 years 8 months ago
Optimal code generation for embedded memory non-homogeneous register architectures
This paper examines the problem of code-generation for expression trees on non-homogeneous register set architectures. It proposes and proves the optimality of an O(n) algorithm f...
Guido Araujo, Sharad Malik