Sciweavers

2531 search results - page 274 / 507
» Group testing in graphs
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 6 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
GLOBECOM
2008
IEEE
16 years 1 months ago
Multi-Cluster Multi-Parent Wake-Up Scheduling in Delay-Sensitive Wireless Sensor Networks
—Immediate notification of urgent but rare events and delivery of time sensitive actuation commands appear in many practical wireless sensor and actuator network applications. M...
Huang Lee, Abtin Keshavarzian, Hamid K. Aghajan
CLUSTER
2004
IEEE
15 years 10 months ago
Rolls: modifying a standard system installer to support user-customizable cluster frontend appliances
The Rocks toolkit [9], [7], [10] uses a graph-based framework to describe the configuration of all node types (termed appliances) that make up a complete cluster. With hundreds of...
Greg Bruno, Mason J. Katz, Federico D. Sacerdoti, ...
AAAI
2010
15 years 8 months ago
Informed Lifting for Message-Passing
Lifted inference, handling whole sets of indistinguishable objects together, is critical to the effective application of probabilistic relational models to realistic real world ta...
Kristian Kersting, Youssef El Massaoudi, Fabian Ha...
RECSYS
2010
ACM
15 years 6 months ago
Affiliation recommendation using auxiliary networks
Social network analysis has attracted increasing attention in recent years. In many social networks, besides friendship links amongst users, the phenomenon of users associating th...
Vishvas Vasuki, Nagarajan Natarajan, Zhengdong Lu,...