3875 search results - page 268 / 775 » Approximation algorithms for the 0-extension problem |
182
Voted
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
Logistic Regression (LR) has been widely used in statistics for many years, and has received extensive study in machine learning community recently due to its close relations to S...
167
click to vote
MFCS
2007
Springer
16 years 26 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...
175
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...
178
click to vote
ISAAC
2004
Springer
16 years 2 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
15 years 12 months 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 ...