Sciweavers

6110 search results - page 778 / 1222
» Approximate Computing
Sort
View
COMGEO
2007
ACM
15 years 6 months ago
A package for exact kinetic data structures and sweepline algorithms
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was ...
Daniel Russel, Menelaos I. Karavelas, Leonidas J. ...
ECCC
2011
205views ECommerce» more  ECCC 2011»
15 years 1 months ago
Graphs of Bounded Treewidth can be Canonized in AC1
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
Fabian Wagner
CVPR
2009
IEEE
17 years 1 months ago
Stereo Matching in the Presence of Sub-Pixel Calibration Errors
Stereo matching commonly requires rectified images that are computed from calibrated cameras. Since all under- lying parametric camera models are only approximations, calibratio...
Heiko Hirschmüller, Stefan K. Gehrig
ICCV
2009
IEEE
16 years 11 months ago
The Dimensionality of Scene Appearance
Low-rank approximation of image collections (e.g., via PCA) is a popular tool in many areas of computer vision. Yet, surprisingly little is known justifying the observation that...
Rahul Garg, Hao Du, Steven M. Seitz, Noah Snavely
CVPR
2008
IEEE
16 years 8 months ago
Shape prior segmentation of multiple objects with graph cuts
We present a new shape prior segmentation method using graph cuts capable of segmenting multiple objects. The shape prior energy is based on a shape distance popular with level se...
Nhat Vu, B. S. Manjunath