Sciweavers

256 search results - page 21 / 52
» A Unified Approach to Approximating Partial Covering Problem...
Sort
View

Book
778views
16 years 10 months ago
Gaussian Processes for Machine Learning
"Gaussian processes (GPs) provide a principled, practical, probabilistic approach to learning in kernel machines. GPs have received increased attention in the machine-learning...
Carl Edward Rasmussen and Christopher K. I. Willia...
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
15 years 5 months ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson
EUSFLAT
2007
136views Fuzzy Logic» more  EUSFLAT 2007»
15 years 1 months ago
Exploring Dialogue Games as Foundation of Fuzzy Logic
A dialogue game based approach to the problem of providing a deeper semantic foundation for t-norm based fuzzy logics is explored. In particular, various versions, extensions and ...
Christian G. Fermüller
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
14 years 12 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
PODC
2005
ACM
15 years 5 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer