1591 search results - page 274 / 319 » Random lifts of graphs |
101
click to vote
VIS
2005
IEEE
15 years 11 months ago
2005
IEEE
We study the problem of visualizing large networks and develop es for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduc...
MICCAI
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Dynamic enhancement causes serious problems for registration of contrast enhanced breast MRI, due to variable uptakes of agent on different tissues or even same tissues i...
KDD
2003
ACM
15 years 10 months ago
2003
ACM
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
VLSID
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper, we describe NoCGEN, a Network On Chip (NoC) generator, which is used to create a simulatable and synthesizable NoC description. NoCGEN uses a set of modularised rou...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...