412 search results - page 32 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
COR
2008
14 years 12 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
STOC
2004
ACM
16 years 3 days ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
112
click to vote
IJCSA
2006
14 years 11 months ago
2006
Analysis of the effect of different parameters of the RC4 encryption algorithm where examined. Some experimental work was performed to illustrate the performance of this algorithm...
101
click to vote
ICML
2005
IEEE
16 years 19 days ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
205
click to vote
ICDE
2000
IEEE
16 years 1 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...