Sciweavers

306 search results - page 47 / 62
» On the Minimal Uncompletable Word Problem
Sort
View
AVBPA
2005
Springer
226views Biometrics» more  AVBPA 2005»
14 years 28 days ago
Discriminant Analysis Based on Kernelized Decision Boundary for Face Recognition
A novel nonlinear discriminant analysis method, Kernelized Decision Boundary Analysis (KDBA), is proposed in our paper, whose Decision Boundary feature vectors are the normal vecto...
Baochang Zhang, Xilin Chen, Wen Gao
STACS
2004
Springer
14 years 22 days ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
WAIM
2009
Springer
13 years 12 months ago
Kernel-Based Transductive Learning with Nearest Neighbors
In the k-nearest neighbor (KNN) classifier, nearest neighbors involve only labeled data. That makes it inappropriate for the data set that includes very few labeled data. In this ...
Liangcai Shu, Jinhui Wu, Lei Yu, Weiyi Meng
NOSSDAV
1992
Springer
13 years 11 months ago
Tactus: Toolkit-Level Support for Synchronized Interactive Multimedia
Tactus addresses problems of synchronizing and controlling various interactive continuous-time media. The Tactus system consists of two main parts. The first is a server that synch...
Roger B. Dannenberg, Thomas P. Neuendorffer, Josep...
PDCN
2007
13 years 8 months ago
One-to-all personalized communication in torus networks
Given a multicomputer system of parallel processors connected in a torus network, the one-to-all personalized communication is to send from the root processor unique data to each ...
Weizhen Mao, Jie Chen, William A. Watson III