412 search results - page 67 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
112
click to vote
VISUALIZATION
1999
IEEE
15 years 6 months ago
1999
IEEE
We describe a framework for time-critical rendering of graphics scenes composed of a large number of objects having complex geometric descriptions. Our technique relies upon a sce...
122
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
149
Voted
VTC
2007
IEEE
15 years 8 months ago
2007
IEEE
— In this paper, we characterize the achievable performance of a wavelet encoding-based videophone system, which further compresses and protects the wavelet-based video codec’s...
150
click to vote
ALGORITHMICA
2004
15 years 1 months ago
2004
We study the Hausdorff Voronoi diagram of point clusters in the plane, a generalization of Voronoi diagrams based on the Hausdorff distance function. We derive a tight combinatori...
120
click to vote
ICML
1996
IEEE
16 years 2 months ago
1996
IEEE
Finding structure in multiple streams of data is an important problem. Consider the streams of data owing from a robot's sensors, the monitors in an intensive care unit, or p...