Sciweavers

7015 search results - page 279 / 1403
» Approximation algorithms for co-clustering
Sort
View
EMNLP
2010
15 years 4 months ago
Turbo Parsers: Dependency Parsing by Approximate Variational Inference
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
André F. T. Martins, Noah A. Smith, Eric P....
NIPS
2008
15 years 8 months ago
Regularized Policy Iteration
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
Amir Massoud Farahmand, Mohammad Ghavamzadeh, Csab...
UAI
2004
15 years 8 months ago
Graph Partition Strategies for Generalized Mean Field Inference
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
Eric P. Xing, Michael I. Jordan
WSC
2001
15 years 8 months ago
Deterministic fluid models of congestion control in high-speed networks
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...
Sanjay Shakkottai, R. Srikant
WWW
2010
ACM
16 years 1 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney