Sciweavers

1017 search results - page 91 / 204
» Register computations on ordinals
Sort
View
PR
2010
148views more  PR 2010»
13 years 6 months ago
Registration and interactive planar segmentation for stereo images of polyhedral scenes
We introduce a two-step iterative segmentation and registration method to find coplanar surfaces among stereo images of a polyhedral environment. The novelties of this paper are:...
Javier-Flavio Vigueras, Mariano Rivera
DAC
2006
ACM
14 years 8 months ago
An efficient retiming algorithm under setup and hold constraints
In this paper we present a new efficient algorithm for retiming sequential circuits with edge-triggered registers under both setup and hold constraints. Compared with the previous...
Chuan Lin, Hai Zhou
ECCV
2006
Springer
14 years 9 months ago
The Alignment Between 3-D Data and Articulated Shapes with Bending Surfaces
In this paper we address the problem of aligning 3-D data with articulated shapes. This problem resides at the core of many motion tracking methods with applications in human motio...
Guillaume Dewaele, Frederic Devernay, Radu Horaud,...
HPCA
2009
IEEE
14 years 8 months ago
iCFP: Tolerating all-level cache misses in in-order processors
Growing concerns about power have revived interest in in-order pipelines. In-order pipelines sacrifice single-thread performance. Specifically, they do not allow execution to flow...
Andrew D. Hilton, Santosh Nagarakatte, Amir Roth
HPCA
2001
IEEE
14 years 8 months ago
CARS: A New Code Generation Framework for Clustered ILP Processors
Clustered ILP processors are characterized by a large number of non-centralized on-chip resources grouped into clusters. Traditional code generation schemes for these processors c...
Krishnan Kailas, Kemal Ebcioglu, Ashok K. Agrawala