Sciweavers

4007 search results - page 724 / 802
» Computation with imprecise probabilities
Sort
View
SPAA
2003
ACM
14 years 2 months ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
WSNA
2003
ACM
14 years 2 months ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li
ATAL
2003
Springer
14 years 2 months ago
Optimizing information exchange in cooperative multi-agent systems
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
Claudia V. Goldman, Shlomo Zilberstein
ICMI
2003
Springer
166views Biometrics» more  ICMI 2003»
14 years 2 months ago
Georgia tech gesture toolkit: supporting experiments in gesture recognition
Gesture recognition is becoming a more common interaction tool in the fields of ubiquitous and wearable computing. Designing a system to perform gesture recognition, however, can...
Tracy L. Westeyn, Helene Brashear, Amin Atrash, Th...
COMPGEOM
2010
ACM
14 years 2 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan