2463 search results - page 456 / 493 » Rankings of Directed Graphs |
155
Voted
CGF
2010
15 years 3 months ago
2010
We present a novel image-based technique for modeling complex unfoliaged trees. Existing tree modeling tools either require capturing a large number of views for dense 3D reconstr...
142
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Signal modeling lies at the core of numerous signal and image processing applications. A recent approach that has drawn considerable attention is sparse representation modeling, in...
162
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
135
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
139
click to vote
DAM
2008
15 years 3 months ago
2008
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...