Sciweavers

376 search results - page 24 / 76
» On the Advice Complexity of Online Problems
Sort
View
NIPS
2008
15 years 1 months ago
Automatic online tuning for fast Gaussian summation
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
Vlad I. Morariu, Balaji Vasan Srinivasan, Vikas C....
SP
2002
IEEE
114views Security Privacy» more  SP 2002»
14 years 11 months ago
Efficiently building on-line tools for distributed heterogeneous environments
Software development is getting more and more complex, especially within distributed middleware-based environments. A major drawback during the overall software development proces...
Günther Rackl, Thomas Ludwig 0002, Markus Lin...

Publication
353views
15 years 12 days ago
Online Multi-Person Tracking-by-Detection from a Single, Uncalibrated Camera
In this paper, we address the problem of automatically detecting and tracking a variable number of persons in complex scenes using a monocular, potentially moving, uncalibrated ca...
Michael D. Breitenstein, Fabian Reichlin, Bastian ...
STACS
1999
Springer
15 years 4 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
ICCL
1998
IEEE
15 years 4 months ago
Controlled Self-Applicable On-Line Partial Evaluation, Using Strategies
On-line partial evaluators are hardly ever selfapplicable, because the complexity of deciding whether to residualize terms causes combinatorial explosion when self-application is ...
M. Beckman, Samuel N. Kamin