Sciweavers

486 search results - page 4 / 98
» Online update of b-trees
Sort
View
MFCS
1994
Springer
13 years 10 months ago
A Competitive Analysis of the List Update Problem with Lookahead
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...
Susanne Albers
ICPR
2010
IEEE
13 years 4 months ago
An Efficient and Stable Algorithm for Learning Rotations
This paper analyses the computational complexity and stability of an online algorithm recently proposed for learning rotations. The proposed algorithm involves multiplicative upda...
Raman Arora, William A. Sethares
ICML
2007
IEEE
14 years 6 months ago
Online kernel PCA with entropic matrix updates
A number of updates for density matrices have been developed recently that are motivated by relative entropy minimization problems. The updates involve a softmin calculation based...
Dima Kuzmin, Manfred K. Warmuth
VLDB
1998
ACM
77views Database» more  VLDB 1998»
13 years 10 months ago
Safely and Efficiently Updating References During On-line Reorganization
With today's demands for continuous availability of mission-critical databases, on-line reorganization is a necessity. In this paper we present a new on-Iine reorganization a...
Chendong Zou, Betty Salzberg
ACCV
2006
Springer
14 years 1 days ago
Online Updating Appearance Generative Mixture Model for Meanshift Tracking
This paper proposes an appearance generative mixture model based on key frames for meanshift tracking. Meanshift tracking algorithm tracks object by maximizing the similarity betwe...
Jilin Tu, Hai Tao, Thomas S. Huang