Sciweavers

3250 search results - page 442 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ICIP
1999
IEEE
16 years 8 months ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...
CVPR
2010
IEEE
16 years 2 months ago
Non-Rigid Structure from Locally-Rigid Motion
We introduce locally-rigid motion, a general framework for solving the M-point, N-view structure-from-motion problem for unknown bodies deforming under orthography. The key idea i...
Jonathan Taylor, Allan Jepson, Kyros Kutulakos
ARC
2010
Springer
387views Hardware» more  ARC 2010»
16 years 1 months ago
Optimising Memory Bandwidth Use for Matrix-Vector Multiplication in Iterative Methods
Computing the solution to a system of linear equations is a fundamental problem in scientific computing, and its acceleration has drawn wide interest in the FPGA community [1–3]...
David Boland, George A. Constantinides
CP
2006
Springer
15 years 10 months ago
Reasoning by Dominance in Not-Equals Binary Constraint Networks
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
Belaid Benhamou, Mohamed Réda Saïdi
CCCG
2004
15 years 8 months ago
Computing the set of all distant horizons of a terrain
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...
William S. Evans, Daniel Archambault, David G. Kir...