5115 search results - page 692 / 1023 » On Randomized Lanczos Algorithms |
189
click to vote
VCIP
2000
15 years 8 months ago
2000
Concentric mosaics have the ability to quickly capture a complete 3D view of a realistic environment and to enable a user to wander freely in the environment. However, the data am...
183
click to vote
AAAI
1996
15 years 8 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...
163
click to vote
ICASSP
2010
IEEE
15 years 6 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...
154
click to vote
ICASSP
2010
IEEE
15 years 6 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 ...
184
click to vote
ICANN
2010
Springer
15 years 6 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...