5580 search results - page 784 / 1116 » Randomized priority algorithms |
140
click to vote
AAAI
1996
15 years 4 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
125
Voted
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
According to Shannon Sampling Theory, Fourier interpolation is the optimal way to reach subpixel accuracy from a properly-sampled digital image. However, for most images this inte...
109
Voted
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
136
Voted
ICANN
2010
Springer
15 years 3 months ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
160
Voted
HICSS
2008
IEEE
15 years 3 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...