Sciweavers

4838 search results - page 227 / 968
» Sampling of information goods
Sort
View
ICPR
2006
IEEE
16 years 20 days ago
Class Separability in Spaces Reduced By Feature Selection
We investigated the geometrical complexity of several high-dimensional, small sample classification problems and its changes due to two popular feature selection procedures, forw...
Erinija Pranckeviciene, TinKam Ho, Ray L. Somorjai
CIBCB
2005
IEEE
16 years 7 days ago
Feature Selection for Microarray Data Using Least Squares SVM and Particle Swarm Optimization
Feature selection is an important preprocessing technique for many pattern recognition problems. When the number of features is very large while the number of samples is relatively...
E. Ke Tang, Ponnuthurai N. Suganthan, Xin Yao
176
Voted
SPAA
2005
ACM
16 years 5 days ago
The expansion and mixing time of skip graphs with applications
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
James Aspnes, Udi Wieder
CSCLP
2005
Springer
16 years 4 days ago
On Generators of Random Quasigroup Problems
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
Roman Barták
IMR
2005
Springer
16 years 3 days ago
Polygon Crawling: Feature-Edge Extraction from a General Polygonal Surface for Mesh Generation
This paper describes a method for extracting feature edges of a polygonal surface for mesh generation. This method can extract feature edges from a polygonal surface typically cre...
Soji Yamakawa, Kenji Shimada