Sciweavers

2367 search results - page 266 / 474
» An experimental analysis of self-adjusting computation
Sort
View
WECWIS
2005
IEEE
137views ECommerce» more  WECWIS 2005»
16 years 2 days ago
Using Singular Value Decomposition Approximation for Collaborative Filtering
Singular Value Decomposition (SVD), together with the Expectation-Maximization (EM) procedure, can be used to find a low-dimension model that maximizes the loglikelihood of obser...
Sheng Zhang, Weihong Wang, James Ford, Fillia Make...
COMPGEOM
2004
ACM
15 years 12 months ago
An empirical comparison of techniques for updating Delaunay triangulations
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
Leonidas J. Guibas, Daniel Russel
CCGRID
2004
IEEE
15 years 10 months ago
Predicting job start times on clusters
In a Computational Grid which consists of many computer clusters, job start time predictions are useful to guide resource selections and balance the workload distribution. However...
Hui Li, David L. Groep, Jeffrey Templon, Lex Wolte...
APPT
2007
Springer
15 years 8 months ago
A Parallel BSP Algorithm for Irregular Dynamic Programming
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
Malcolm Yoke-Hean Low, Weiguo Liu, Bertil Schmidt
JRTIP
2008
118views more  JRTIP 2008»
15 years 6 months ago
A fast feature-assisted adaptive early termination approach for multiple reference frames motion estimation in H.264
Abstract The multiple reference frames motion estimation approach used in H.264 is computationally intensive. This paper presents a fast or computationally efficient feature-assist...
Jianfeng Ren, Nasser D. Kehtarnavaz, Madhukar Buda...