Sciweavers

1458 search results - page 118 / 292
» Monads for incremental computing
Sort
View
165
Voted
CVPR
2011
IEEE
14 years 7 months ago
Fusion of GPS and Structure-from-Motion using Constrained Bundle Adjustments
Two problems occur when bundle adjustment (BA) is applied on long image sequences: the large calculation time and the drift (or error accumulation). In recent work, the calculatio...
Maxime Lhuillier
133
Voted
ACL
2011
14 years 7 months ago
Integrating surprisal and uncertain-input models in online sentence comprehension: formal techniques and empirical results
A system making optimal use of available information in incremental language comprehension might be expected to use linguistic knowledge together with current input to revise beli...
Roger Levy
158
Voted
TOG
2012
208views Communications» more  TOG 2012»
13 years 5 months ago
Video-based 3D motion capture through biped control
Marker-less motion capture is a challenging problem, particularly when only monocular video is available. We estimate human motion from monocular video by recovering three-dimensi...
Marek Vondrak, Leonid Sigal, Jessica K. Hodgins, O...
111
Voted
HPCA
2006
IEEE
16 years 3 months ago
Probabilistic counter updates for predictor hysteresis and stratification
Hardware counters are a fundamental building block of modern high-performance processors. This paper explores two applications of probabilistic counter updates, in which the outpu...
Nicholas Riley, Craig B. Zilles
203
Voted
PODC
1993
ACM
15 years 7 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld