779 search results - page 26 / 156 » Algorithms for the Sample Mean of Graphs |
136
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Real-world face recognition systems often have to face the single sample per person (SSPP) problem, that is, only a single training sample for each person is enrolled in the datab...
153
click to vote
ICC
2009
IEEE
15 years 11 months ago
2009
IEEE
—Cellular systems in general suffer from co-channel interference, when simultaneous transmissions in other cells use the same physical resources. In order to mitigate such co-cha...
127
click to vote
TVCG
2008
15 years 4 months ago
2008
In this paper we present an algorithm that operates on a triangular mesh and classifies each face of a triangle as either inside or outside. We present three example applications o...
118
click to vote
NIPS
2008
15 years 5 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
137
click to vote
TDSC
2008
15 years 4 months ago
2008
The probabilistic packet marking (PPM) algorithm is a promising way to discover the Internet map or an attack graph that the attack packets traversed during a distributed denial-of...