Sciweavers

1094 search results - page 89 / 219
» One Size Fits All
Sort
View
ANOR
2005
98views more  ANOR 2005»
13 years 9 months ago
Condorcet Winners for Public Goods
In this work, we consider a public facility allocation problem decided through a voting process under the majority rule. A location of the public facility is a majority rule winner...
Lihua Chen, Xiaotie Deng, Qizhi Fang, Feng Tian
COMBINATORICS
2000
92views more  COMBINATORICS 2000»
13 years 9 months ago
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
Jason P. Bell, Edward A. Bender, Peter J. Cameron,...
IJON
2007
94views more  IJON 2007»
13 years 9 months ago
A method for speeding up feature extraction based on KPCA
Kernel principal component analysis (KPCA) extracts features of samples with an efficiency in inverse proportion to the size of the training sample set. In this paper, we develop...
Yong Xu, David Zhang, Fengxi Song, Jing-Yu Yang, Z...
IJON
2002
72views more  IJON 2002»
13 years 8 months ago
Modeling large cortical networks with growing self-organizing maps
Self-organizing computational models with specific intracortical connections can explain many features of visual cortex. However, due to their computation and memory requirements,...
James A. Bednar, Amol Kelkar, Risto Miikkulainen
DCC
2008
IEEE
14 years 8 months ago
On vector space partitions and uniformly resolvable designs
Let Vn(q) denote a vector space of dimension n over the field with q elements. A set P of subspaces of Vn(q) is a partition of Vn(q) if every nonzero vector in Vn(q) is contained ...
Andrew Blinco, Saad El-Zanati, G. F. Seelinger, P....