Sciweavers

32 search results - page 2 / 7
» Probe set algorithms: is there a rational best bet
Sort
View
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
13 years 6 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
INFOCOM
2007
IEEE
13 years 11 months ago
Diagnosing Link-Level Anomalies Using Passive Probes
Abstract—In this paper, we develop passive network tomography techniques for inferring link-level anomalies like excessive loss rates and delay from path-level measurements. Our ...
Shipra Agrawal, K. V. M. Naidu, Rajeev Rastogi
FOCS
2009
IEEE
14 years 2 days ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
AAAI
1994
13 years 6 months ago
Improving Learning Performance Through Rational Resource Allocation
This article shows how rational analysis can be used to minimize learning cost for a general class of statistical learning problems. We discuss the factors that influence learning...
Jonathan Gratch, Steve A. Chien, Gerald DeJong
WDAG
2005
Springer
100views Algorithms» more  WDAG 2005»
13 years 10 months ago
The Dynamic And-Or Quorum System
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
Uri Nadav, Moni Naor