20294 search results - page 36 / 4059 » Algorithmic Information Theory |
123
Voted
SIGIR
2002
ACM
15 years 3 months ago
2002
ACM
We describe a new family of topic-ranking algorithms for multi-labeled documents. The motivation for the algorithms stems from recent advances in online learning algorithms. The a...
183
click to vote
Presentation
A talk on Nobel Talk by Nobel laureate John C Harsayni, in Topics in Game Theory Course, IISc, November 2008
102
Voted
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
154
Voted
SIGIR
2005
ACM
15 years 9 months ago
2005
ACM
Latent semantic indexing (LSI) is a well-known unsupervised approach for dimensionality reduction in information retrieval. However if the output information (i.e. category labels...
131
Voted
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...