Sciweavers

3715 search results - page 377 / 743
» A Space Optimization for FP-Growth
Sort
View
TSP
2008
116views more  TSP 2008»
15 years 6 months ago
Fast Blind Separation of Long Mixture Recordings Using Multivariate Polynomial Identification
This correspondence presents new approaches for optimizing kurtosis-based separation criteria in the case of long mixture recordings. Our methods are based on a multivariate polyno...
Johan Thomas, Yannick Deville, Shahram Hosseini
AROBOTS
2002
126views more  AROBOTS 2002»
15 years 6 months ago
Selecting Landmarks for Localization in Natural Terrain
We describe techniques to optimally select landmarks for performing mobile robot localization by matching terrain maps. The method is based upon a maximum-likelihood robot localiza...
Clark F. Olson
CG
2002
Springer
15 years 6 months ago
Tackling Post's Correspondence Problem
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
Ling Zhao
NN
2000
Springer
161views Neural Networks» more  NN 2000»
15 years 6 months ago
How good are support vector machines?
Support vector (SV) machines are useful tools to classify populations characterized by abrupt decreases in density functions. At least for one class of Gaussian data model the SV ...
Sarunas Raudys
TIT
1998
126views more  TIT 1998»
15 years 6 months ago
An Asymptotic Property of Model Selection Criteria
—Probability models are estimated by use of penalized log-likelihood criteria related to AIC and MDL. The accuracies of the density estimators are shown to be related to the trad...
Yuhong Yang, Andrew R. Barron