Sciweavers

1716 search results - page 314 / 344
» Approximation Algorithms for Data Broadcast in Wireless Netw...
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Aggregate Threshold Queries in Sensor Networks
— An important class of queries over sensor networks are network-wide aggregation queries. In this work we study a class of aggregation queries which we refer to as aggregate thr...
Izchak Sharfman, Assaf Schuster, Daniel Keren
PODC
2009
ACM
14 years 8 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
KDD
2008
ACM
174views Data Mining» more  KDD 2008»
14 years 8 months ago
Effective label acquisition for collective classification
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
Mustafa Bilgic, Lise Getoor
DAC
2009
ACM
14 years 9 days ago
Vicis: a reliable network for unreliable silicon
Process scaling has given designers billions of transistors to work with. As feature sizes near the atomic scale, extensive variation and wearout inevitably make margining unecono...
David Fick, Andrew DeOrio, Jin Hu, Valeria Bertacc...
TON
2008
125views more  TON 2008»
13 years 7 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni