Sciweavers

1074 search results - page 105 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
SAC
2004
ACM
15 years 8 months ago
A robust deception-free coalition formation model
We study two properties of coalition formation algorithms, very important for their application in real-life scenarios: robustness and tolerance to some agent misbehaviors. The st...
María-Victoria Belmonte, Ricardo Conejo, Jo...
118
Voted
ASIAN
2003
Springer
113views Algorithms» more  ASIAN 2003»
15 years 8 months ago
Global Predicate Detection under Fine-Grained Modalities
Predicate detection is an important problem in distributed systems. Based on the temporal interactions of intervals, there exists a rich class of modalities under which global pred...
Punit Chandra, Ajay D. Kshemkalyani
ICML
2000
IEEE
15 years 7 months ago
Lightweight Rule Induction
We propose a new rule induction algorithm for solving classification problems via probability estimation. The main advantage of decision rules is their simplicity and good interp...
Sholom M. Weiss, Nitin Indurkhya
113
Voted
NIPS
2004
15 years 4 months ago
Neighbourhood Components Analysis
In this paper we propose a novel method for learning a Mahalanobis distance measure to be used in the KNN classification algorithm. The algorithm directly maximizes a stochastic v...
Jacob Goldberger, Sam T. Roweis, Geoffrey E. Hinto...
SODA
2004
ACM
91views Algorithms» more  SODA 2004»
15 years 4 months ago
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
Carlos Brito, Elias Koutsoupias, Shailesh Vaya