301 search results - page 33 / 61 » On Finding Dense Subgraphs |
VLDB
2007
ACM
15 years 3 months ago
2007
ACM
PageRank-style authority analyses of Web graphs are of great importance for Web mining. Such authority analyses also apply to hot “Web 2.0” applications that exhibit a natural...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
IPL
2006
14 years 9 months ago
2006
Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficie...
184
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...