Sciweavers

779 search results - page 26 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
CVPR
2010
IEEE
15 years 5 months ago
Adaptive Generic Learning for Face Recognition from a Single Sample per Person
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...
Yu Su, Shiguang Shan, Xilin Chen, wen Gao
ICC
2009
IEEE
162views Communications» more  ICC 2009»
15 years 6 months ago
Distributed Uplink Signal Processing of Cooperating Base Stations Based on IQ Sample Exchange
—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...
Christian Hoymann, Laetitia Falconetti, Rohit Gupt...
TVCG
2008
110views more  TVCG 2008»
14 years 11 months ago
Visibility-driven Mesh Analysis and Visualization through Graph Cuts
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...
Kaichi Zhou, Eugene Zhang, Jirí Bittner, Pe...
NIPS
2008
15 years 1 months ago
Online Prediction on Large Diameter Graphs
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 ...
Mark Herbster, Guy Lever, Massimiliano Pontil
TDSC
2008
83views more  TDSC 2008»
14 years 11 months ago
A Precise Termination Condition of the Probabilistic Packet Marking Algorithm
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...
T. Y. Wong, Man Hon Wong, John C. S. Lui