779 search results - page 71 / 156 » Algorithms for the Sample Mean of Graphs |
160
click to vote
AAAI
2010
15 years 6 months ago
2010
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...
189
click to vote
JMLR
2010
14 years 11 months ago
2010
We study the problem of image denoising where images are assumed to be samples from low dimensional (sub)manifolds. We propose the algorithm of locally linear denoising. The algor...
147
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
: Network intrusion detection sensors are usually built around low level models of network traffic. This means that their output is of a similarly low level and as a consequence, ...
162
click to vote
KDD
2008
ACM
16 years 4 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 ...
154
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...