109 search results - page 5 / 22 » Vertex Ranking with Capacity |
135
click to vote
WAW
2007
Springer
15 years 10 months ago
2007
Springer
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
156
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
159
click to vote
COMBINATORICA
1998
15 years 3 months ago
1998
For an undirected graph G = (V, E), let Gn denote the graph whose vertex set is V n in which two distinct vertices (u1, u2, . . . , un) and (v1, v2, . . . , vn) are adjacent iff ...
128
click to vote
ICC
2009
IEEE
15 years 10 months ago
2009
IEEE
— A single on-frequency, full duplex wireless repeater is considered for enhancing the capacity of a long-distance 2x2 multiple-input multiple-output (MIMO) wireless link with a ...
137
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
In this paper, we propose a new transductive learning framework for image retrieval, in which images are taken as vertices in a weighted hypergraph and the task of image search is...