5595 search results - page 367 / 1119 » Approximation Algorithms for Clustering Problems |
168
click to vote
MFCS
2007
Springer
16 years 27 days ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
178
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
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...
204
click to vote
CVPR
2010
IEEE
15 years 4 months ago
2010
IEEE
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
180
click to vote
ISAAC
2004
Springer
16 years 4 days ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
159
click to vote
ADHOCNOW
2003
Springer
16 years 5 hour ago
2003
Springer
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...