Sciweavers

4171 search results - page 31 / 835
» Choice numbers of graphs
Sort
View
NIPS
2000
13 years 11 months ago
Automatic Choice of Dimensionality for PCA
A central issue in principal component analysis (PCA) is choosing the number of principal components to be retained. By interpreting PCA as density estimation, this paper shows ho...
Thomas P. Minka
CSDA
2006
87views more  CSDA 2006»
13 years 9 months ago
Choice of B-splines with free parameters in the flexible discriminant analysis context
Flexible discriminant analysis (FDA) is a general methodology which aims at providing tools for multigroup non linear classification. It consists in a nonparametric version of dis...
Christelle Reynès, Robert Sabatier, Nicolas...
JUCS
2010
151views more  JUCS 2010»
13 years 4 months ago
A Semantic Wiki Framework for Reconciling Conflict Collaborations Based on Selecting Consensus Choice
: Semantic wikis have been regarded as an important collaboration tool among a number of experts from multiple domains. This wiki platform can play a role of collaborative knowledg...
Dosam Hwang, Ngoc Thanh Nguyen, Jason J. Jung, Abo...
DM
2000
82views more  DM 2000»
13 years 9 months ago
On special numberings of hypergraphs
Generalizing a result of Bodendiek and Burosch on graphs it is proved that every vertex-simple
Günter Schaar
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 10 months ago
Parameterizing by the Number of Numbers
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
Michael R. Fellows, Serge Gaspers, Frances A. Rosa...