Sciweavers

101 search results - page 12 / 21
» Fast approximation of the permanent for very dense problems
Sort
View
ICCV
2003
IEEE
15 years 2 months ago
Computing MAP trajectories by representing, propagating and combining PDFs over groups
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
Paul Smith, Tom Drummond, Kimon Roussopoulos
CGF
2005
156views more  CGF 2005»
14 years 9 months ago
Efficient Animation of Point-Sampled Thin Shells
We present a novel framework for the efficient simulation and animation of discrete thin shells. Our method takes a point sampled surface as input and performs all necessary compu...
Martin Wicke, Denis Steinemann, Markus H. Gross
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
15 years 1 months ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...
TASE
2011
IEEE
14 years 1 months ago
Fast Intersection-Free Offset Surface Generation From Freeform Models With Triangular Meshes
Abstract—A fast offset surface generation approach is presented in this paper to construct intersection-free offset surfaces, which preserve sharp features, from freeform triangu...
Shengjun Liu, Charlie C. L. Wang
ICCV
2003
IEEE
15 years 11 months ago
Fast Intensity-based 2D-3D Image Registration of Clinical Data Using Light Fields
Registration of a preoperative CT (3D) image to one or more X-ray projection (2D) images, a special case of the pose estimation problem, has been attempted in a variety of ways wi...
Daniel B. Russakoff, Torsten Rohlfing, Calvin R. M...