Sciweavers

486 search results - page 46 / 98
» Online update of b-trees
Sort
View
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
14 years 11 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
TSMC
2008
147views more  TSMC 2008»
14 years 9 months ago
Tracking of Multiple Targets Using Online Learning for Reference Model Adaptation
Recently, much work has been done in multiple ob-4 ject tracking on the one hand and on reference model adaptation5 for a single-object tracker on the other side. In this paper, we...
Franz Pernkopf
INFOCOM
1999
IEEE
15 years 2 months ago
A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees
With the proliferationof multimediagroup applications, the construction of multicast trees satisfying Qualityof ServiceQoS requirementsis becominga problemof prime importance. Man...
R. Sriram, G. Manimaran, C. Siva Ram Murthy
JMLR
2008
230views more  JMLR 2008»
14 years 9 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
DATAMINE
1999
140views more  DATAMINE 1999»
14 years 9 months ago
A Scalable Parallel Algorithm for Self-Organizing Maps with Applications to Sparse Data Mining Problems
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
Richard D. Lawrence, George S. Almasi, Holly E. Ru...