Sciweavers

449 search results - page 32 / 90
» Distributed Reasoning in a Peer-to-Peer Setting
Sort
View
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 1 days ago
Optimal Random Matchings on Trees and Applications
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
Jeff Abrahamson, Béla Csaba, Ali Shokoufand...
WINE
2009
Springer
194views Economy» more  WINE 2009»
15 years 4 months ago
Mechanism Design for Complexity-Constrained Bidders
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
Ravi Kumar, Mohammad Mahdian, Amin Sayedi
ICML
2005
IEEE
15 years 10 months ago
ROC confidence bands: an empirical evaluation
This paper is about constructing confidence bands around ROC curves. We first introduce to the machine learning community three band-generating methods from the medical field, and...
Sofus A. Macskassy, Foster J. Provost, Saharon Ros...
CAV
1993
Springer
108views Hardware» more  CAV 1993»
15 years 2 months ago
Computer-Assisted Simulation Proofs
Abstract. This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I O automata to extract a set of proof obligations for s...
Jørgen F. Søgaard-Andersen, Stephen ...
CORR
2006
Springer
105views Education» more  CORR 2006»
14 years 10 months ago
Generalization error bounds in semi-supervised classification under the cluster assumption
We consider semi-supervised classification when part of the available data is unlabeled. These unlabeled data can be useful for the classification problem when we make an assumpti...
Philippe Rigollet