Sciweavers

3630 search results - page 267 / 726
» Fast Marching Methods
Sort
View
UAI
2000
15 years 7 months ago
Fast Planning in Stochastic Games
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...
Michael J. Kearns, Yishay Mansour, Satinder P. Sin...
CVPR
2010
IEEE
15 years 6 months ago
Fast directional chamfer matching
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
Ming-Yu Liu, Oncel Tuzel, Ashok Veeraraghavan, Ram...
CMPB
2010
152views more  CMPB 2010»
15 years 6 months ago
Fast free-form deformation using graphics processing units
A large number of algorithms have been developed to perform non-rigid registration and it is a tool commonly used in medical image analysis. The FreeForm Deformation algorithm is ...
Marc Modat, Gerard R. Ridgway, Zeike A. Taylor, Ma...
CGF
2008
151views more  CGF 2008»
15 years 6 months ago
Apparent Greyscale: A Simple and Fast Conversion to Perceptually Accurate Images and Video
This paper presents a quick and simple method for converting complex images and video to perceptually accurate greyscale versions. We use a two-step approach first to globally ass...
Kaleigh Smith, Pierre-Edouard Landes, Joëlle ...
DISOPT
2007
155views more  DISOPT 2007»
15 years 6 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin