691 search results - page 104 / 139 » Non-negative graph embedding |
92
Voted
PKDD
2010
Springer
14 years 11 months ago
2010
Springer
Pattern mining methods for graph data have largely been restricted to ground features, such as frequent or correlated subgraphs. Kazius et al. have demonstrated the use of elaborat...
119
click to vote
CODES
2010
IEEE
14 years 10 months ago
2010
IEEE
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
106
Voted
WWW
2011
ACM
14 years 7 months ago
2011
ACM
Most Semantic Web data visualization tools structure the representation according to the concept definitions and interrelations that constitute the ontology’s vocabulary. Insta...
124
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
172
Voted
SIGMOD
2008
ACM
16 years 22 days ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...