Sciweavers

324 search results - page 48 / 65
» Bounds for Functions of Dependent Risks
Sort
View
IAT
2009
IEEE
14 years 2 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
13 years 11 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
ICRA
2009
IEEE
153views Robotics» more  ICRA 2009»
14 years 2 months ago
Using critical junctures and environmentally-dependent information for management of tightly-coupled cooperation in heterogeneou
— This paper addresses the challenge of forming appropriate heterogeneous robot teams to solve tightly-coupled, potentially multi-robot tasks, in which the robot capabilities may...
Lynne E. Parker, Christopher M. Reardon, Heeten Ch...
ER
2004
Springer
169views Database» more  ER 2004»
14 years 24 days ago
Intentional Modeling to Support Identity Management
Identity management has arisen as a major and urgent challenge for internet-based communications and information services. Internet services involve complex networks of relationshi...
Lin Liu, Eric S. K. Yu
MIE
2008
119views Healthcare» more  MIE 2008»
13 years 8 months ago
Systematizing medical alerts
The current Swedish regulations for medical alerts in health records were designed for paper records. Suggestions for computerized systems are now being investigated. A proposed mo...
Mattias Pettersson, Jenny Wihlborg, Rikard Lö...