4816 search results - page 128 / 964 » Performance analysis of the AntNet algorithm |
124
click to vote
ICPP
1993
IEEE
15 years 9 months ago
1993
IEEE
:. In designing application-specific bit-level architectures and in programming existing bit-level processor arrays, it is necessary to expand a word-level algorithm into its bit-...
140
Voted
NIPS
2004
15 years 6 months ago
2004
We provide a worst-case analysis of selective sampling algorithms for learning linear threshold functions. The algorithms considered in this paper are Perceptron-like algorithms, ...
135
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
169
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
The discovery of biclusters, which denote groups of items that show coherent values across a subset of all the transactions in a data set, is an important type of analysis perform...
138
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy -- even on parallel processors -- unlike the...