Sciweavers

6365 search results - page 243 / 1273
» Fast Local Computation Algorithms
Sort
View
WSCG
2004
159views more  WSCG 2004»
15 years 7 months ago
A Fast Method for Applying Rigid Transformations to Volume Data
Volume rendering is a widespread method for displaying graphical models in fields such as medical visualization or engineering. The required image information is stored in a volum...
Jan Fischer, Ángel del Río
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
16 years 3 months ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
Gennette Gill, Vishal Gupta, Montek Singh
ICCV
2003
IEEE
16 years 8 months ago
Fast Pose Estimation with Parameter-Sensitive Hashing
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
Gregory Shakhnarovich, Paul A. Viola, Trevor Darre...
177
Voted
HCW
2000
IEEE
15 years 11 months ago
Fast and Effective Task Scheduling in Heterogeneous Systems
Recently, we presented two very low-cost approaches to compile-time list scheduling where the tasks’ priorities are computed statically or dynamically, respectively. For homogen...
Andrei Radulescu, Arjan J. C. van Gemund
ECCV
2010
Springer
15 years 7 months ago
Robust and Fast Collaborative Tracking with Two Stage Sparse Optimization
Abstract. The sparse representation has been widely used in many areas and utilized for visual tracking. Tracking with sparse representation is formulated as searching for samples ...
Baiyang Liu, Lin Yang, Junzhou Huang, Peter Meer, ...