2060 search results - page 264 / 412 » Some Applications of Coding Theory in Computational Complexi... |
150
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...
120
click to vote
EICS
2010
ACM
15 years 9 months ago
2010
ACM
Modern User Interfaces (UI) must deal with the increasing complexity of applications as well as new features such as the capacity of UIs to be dynamically adapted to the context o...
140
click to vote
COLT
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
130
click to vote
PE
2007
Springer
15 years 4 months ago
2007
Springer
Multicast-based inference has been proposed as a method of estimating average loss rates of internal network links, using end-to-end loss measurements of probes sent over a multic...
141
click to vote
CHI
2001
ACM
16 years 4 months ago
2001
ACM
Building trust with users is crucial in a wide range of applications, such as advice-giving or financial transactions, and some minimal degree of trust is required in all applicat...