Sciweavers

654 search results - page 70 / 131
» An efficient approximation algorithm for the survivable netw...
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
On the Hardness of Being Truthful
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
Christos H. Papadimitriou, Michael Schapira, Yaron...
ICDE
2007
IEEE
148views Database» more  ICDE 2007»
14 years 10 months ago
Efficient Detection of Distributed Constraint Violations
In many distributed environments, the primary function of monitoring software is to detect anomalies, that is, instances when system behavior deviates substantially from the norm....
Shipra Agrawal, Supratim Deb, K. V. M. Naidu, Raje...
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
14 years 1 months ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
WINET
2008
86views more  WINET 2008»
13 years 8 months ago
Relay sensor placement in wireless sensor networks
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang, Baogang ...
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 9 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer