Sciweavers

356 search results - page 37 / 72
» Solving the Small Sample Size Problem of LDA
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
CDC
2009
IEEE
164views Control Systems» more  CDC 2009»
13 years 5 months ago
Real-time MPC - Stability through robust MPC design
Recent results have suggested that online Model Predictive Control (MPC) can be computed quickly enough to control fast sampled systems. High-speed applications impose a hard real-...
Melanie Nicole Zeilinger, Colin Neil Jones, Davide...
ICPR
2008
IEEE
14 years 2 months ago
Pre-extracting method for SVM classification based on the non-parametric K-NN rule
With the increase of the training set’s size, the efficiency of support vector machine (SVM) classifier will be confined. To solve such a problem, a novel preextracting method f...
Deqiang Han, Chongzhao Han, Yi Yang, Yu Liu, Wenta...
SCALESPACE
2007
Springer
14 years 1 months ago
Towards Segmentation Based on a Shape Prior Manifold
Incorporating shape priors in image segmentation has become a key problem in computer vision. Most existing work is limited to a linearized shape space with small deformation modes...
Patrick Etyngier, Renaud Keriven, Jean-Philippe Po...
FLAIRS
2006
13 years 9 months ago
GFAM: Evolving Fuzzy ARTMAP Neural Networks
Fuzzy ARTMAP (FAM) is one of the best neural network architectures in solving classification problems. One of the limitations of Fuzzy ARTMAP that has been extensively reported in...
Ahmad Al-Daraiseh, Michael Georgiopoulos, Annie S....