1381 search results - page 151 / 277 » Fast Filtered Sampling |
145
click to vote
KDD
2008
ACM
16 years 2 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
132
click to vote
KDD
2007
ACM
16 years 2 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...
147
click to vote
ICCV
2007
IEEE
15 years 8 months ago
2007
IEEE
Multi-chamber heart segmentation is a prerequisite for global quantification of the cardiac function. The complexity of cardiac anatomy, poor contrast, noise or motion artifacts ...
147
click to vote
ICCV
2005
IEEE
15 years 8 months ago
2005
IEEE
We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible...
163
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...