1756 search results - page 203 / 352 » Directed scale-free graphs |
161
click to vote
CSE
2009
IEEE
16 years 18 days ago
2009
IEEE
Abstract—Collaborative or “Social” filtering has been successfully deployed over the years as a technique for analysing large amounts of user-preference knowledge to predict...
170
click to vote
IEEECIT
2009
IEEE
16 years 14 days ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
150
click to vote
WEBDB
2009
Springer
16 years 12 days ago
2009
Springer
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...
123
click to vote
COCO
2007
Springer
16 years 6 hour ago
2007
Springer
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
173
click to vote
WG
2007
Springer
15 years 12 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...