412 search results - page 28 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
ATAL
2005
Springer
15 years 5 months ago
2005
Springer
Social insects such as ants and bees perform complex tasks with pheromone communication despite lack of top-down style control. We have examined applications of this pheromone par...
ESA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (th...
119
click to vote
RT
1995
Springer
15 years 3 months ago
1995
Springer
: This paper introduces an efficient hierarchical algorithm capable of simulating light transfer for complex scenes containing non-diffuse surfaces. The algorithmstemsfroma newfor...
122
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
Lossy compression of hyperspectral and ultraspectral images is traditionally performed using 3D transform coding. This approach yields good performance, but its complexity and mem...
111
click to vote
SOFSEM
2000
Springer
15 years 3 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...