Sciweavers

2745 search results - page 79 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
93
Voted
ICPR
2008
IEEE
16 years 4 months ago
Force histograms computed in O(NlogN)
The relative position between two objects in a 2D raster image is often represented quantitatively by a force histogram. In the general case, force histograms are computed in O(KN...
JingBo Ni, Pascal Matsakis
CVPR
2004
IEEE
16 years 5 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
140
Voted
EMNLP
2009
15 years 1 months ago
Fast Translation Rule Matching for Syntax-based Statistical Machine Translation
In a linguistically-motivated syntax-based translation system, the entire translation process is normally carried out in two steps, translation rule matching and target sentence d...
Hui Zhang, Min Zhang, Haizhou Li, Chew Lim Tan
SPAA
2004
ACM
15 years 9 months ago
Online algorithms for prefetching and caching on parallel disks
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter
135
Voted
ICIP
2009
IEEE
15 years 1 months ago
Fast subspace-based tensor data filtering
Subspace-based methods rely on dominant element selection from second order statistics. They have been extended to tensor processing, in particular to tensor data filtering. For t...
Julien Marot, Caroline Fossati, Salah Bourennane