Sciweavers

2570 search results - page 39 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
ICDIM
2008
IEEE
15 years 4 months ago
A fast approximate algorithm for large-scale Latent Semantic Indexing
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
Dell Zhang, Zheng Zhu
SIGGRAPH
1994
ACM
15 years 1 months ago
A fast shadow algorithm for area light sources using backprojection
The fast identification of shadow regions due to area light sources is necessary for realistic rendering and for discontinuity meshing for global illumination. A new shadow-determ...
George Drettakis, Eugene Fiume
ICIP
2007
IEEE
15 years 4 months ago
Fast Blotch Detection Algorithm for Degraded Film Sequences Based on MRF Models
This paper proposes a fast blotch detection algorithm based on a Markov Random Field (MRF) model with less computational load and with lower false alarm rate than the existing MRF...
Sang-Churl Nam, Masahide Abe, Masayuki Kawamata
CG
2007
Springer
14 years 10 months ago
A fast all nearest neighbor algorithm for applications involving large point-clouds
Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollificatio...
Jagan Sankaranarayanan, Hanan Samet, Amitabh Varsh...
CVPR
2011
IEEE
14 years 7 months ago
Globally-Optimal Greedy Algorithms for Tracking a Variable Number of Objects
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
Hamed Pirsiavash, Deva Ramanan, Charless Fowlkes