557 search results - page 68 / 112 » Visualizing Weighted Edges in Graphs |
APPROX
2007
Springer
15 years 5 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
ACL
2006
15 years 16 days ago
2006
Shortage of manually labeled data is an obstacle to supervised relation extraction methods. In this paper we investigate a graph based semi-supervised learning algorithm, a label ...
113
click to vote
SIBGRAPI
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we present a novel method for estimating the effective number of independent variables in imaging applications that require multiple hypothesis testing. The method ...
105
click to vote
SIAMCOMP
1998
14 years 10 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
106
click to vote
APPROX
2005
Springer
15 years 4 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...