Sciweavers

7055 search results - page 1073 / 1411
» Some New 4-Designs
Sort
View
NETWORKING
2007
15 years 9 months ago
Optimal Topology Design for Overlay Networks
Abstract. The topology creation is one of the most important step for the design of an overlay network. Traffic characteristic and volume, and behavior of nodes which can be sel...
Mina Kamel, Caterina M. Scoglio, Todd Easton
NIPS
2007
15 years 9 months ago
Incremental Natural Actor-Critic Algorithms
We present four new reinforcement learning algorithms based on actor-critic and natural-gradient ideas, and provide their convergence proofs. Actor-critic reinforcement learning m...
Shalabh Bhatnagar, Richard S. Sutton, Mohammad Gha...
NIPS
2007
15 years 9 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 9 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
15 years 9 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
« Prev « First page 1073 / 1411 Last » Next »