Sciweavers

6365 search results - page 187 / 1273
» Fast Local Computation Algorithms
Sort
View
136
Voted
MSE
2000
IEEE
110views Hardware» more  MSE 2000»
15 years 10 months ago
Nobel Successive Elimination Algorithms for the Estimation of Motion Vectors
In this paper, we present fast algorithms to reduce the computations of block matching algorithms for motion estimation in video coding. Nobel Successive Elimination Algorithms fo...
Soo-Mok Jung, Sung-Chul Shin, Hyunki Baik, Myong-S...
162
Voted
RT
1998
Springer
15 years 10 months ago
Automatic Calculation of Soft Shadow Textures for Fast, High-Quality Radiosity
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
Cyril Soler, François X. Sillion
SIGCOMM
2009
ACM
16 years 20 days ago
OLS: opportunistic localization system for smart phones devices
In this paper, we describe the opportunistic localization, which enables localization services that works seamlessly in heterogeneous environments including indoors as oppose to G...
Martin Klepal, Maarten Weyn, Warsun Najib, Inge By...
178
Voted
RECSYS
2010
ACM
15 years 6 months ago
Incremental collaborative filtering via evolutionary co-clustering
Collaborative filtering is a popular approach for building recommender systems. Current collaborative filtering algorithms are accurate but also computationally expensive, and so ...
Mohammad Khoshneshin, W. Nick Street
168
Voted
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
15 years 11 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader