779 search results - page 42 / 156 » Algorithms for the Sample Mean of Graphs |
178
click to vote
CVPR
2004
IEEE
15 years 8 months ago
2004
IEEE
In this paper, we propose a generative model for representing complex motion, such as wavy river, dancing fire and dangling cloth. Our generative method consists of four component...
163
click to vote
IJCAI
2003
15 years 5 months ago
2003
We equate nonlinear dimensionality reduction (NLDR) to graph embedding with side information about the vertices, and derive a solution to either problem in the form of a kernel-ba...
134
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
143
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
For many tracking and surveillance applications, background subtraction provides an effective means of segmenting objects moving in front of a static background. Researchers have ...
102
click to vote
CVPR
1999
IEEE
16 years 6 months ago
1999
IEEE
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...