4110 search results - page 321 / 822 » Efficient algorithms for the 2-gathering problem |
209
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
192
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Subspace learning based face recognition methods have attracted considerable interests in recent years, including Principal Component Analysis (PCA), Linear Discriminant Analysis ...
173
click to vote
EMMCVPR
2005
Springer
16 years 6 days ago
2005
Springer
In this paper, a novel training method is proposed to increase the classification efficiency of support vector machine (SVM). The efficiency of the SVM is determined by the number ...
193
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Lately there exist increasing demands for online abnormality monitoring over trajectory streams, which are obtained from moving object tracking devices. This problem is challengin...
156
click to vote
APPT
2007
Springer
16 years 26 days ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...