301 search results - page 50 / 61 » On Finding Dense Subgraphs |
CIVR
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we describe an approach for mining images of objects (such as touristic sights) from community photo collections in an unsupervised fashion. Our approach relies on ...
81
Voted
CVPR
2008
IEEE
14 years 11 months ago
2008
IEEE
We present a new approach for building reconstruction from a single Digital Elevation Model (DEM). It treats buildings as an assemblage of simple urban structures extracted from a...
77
Voted
FIMI
2003
14 years 11 months ago
2003
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
71
Voted
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
IVC
2008
14 years 9 months ago
2008
Groupwise non-rigid registration aims to find a dense correspondence across a set of images, so that analogous structures in the images are aligned. For purely automatic inter-sub...