Sciweavers

1756 search results - page 203 / 352
» Directed scale-free graphs
Sort
View
CSE
2009
IEEE
14 years 3 months ago
A Visual Interface for Social Information Filtering
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...
John O'Donovan, Brynjar Gretarsson, Svetlin Bostan...
IEEECIT
2009
IEEE
14 years 3 months ago
Clustering of Software Systems Using New Hybrid Algorithms
—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. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi
WEBDB
2009
Springer
112views Database» more  WEBDB 2009»
14 years 2 months ago
Querying DAG-shaped Execution Traces Through Views
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...
Maya Ben-Ari, Tova Milo, Elad Verbin
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
14 years 2 months ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
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...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan
WG
2007
Springer
14 years 2 months ago
Minimum-Weight Cycle Covers and Their Approximability
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 ...
Bodo Manthey