Sciweavers

1957 search results - page 366 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
CVPR
2010
IEEE
15 years 6 months ago
Scalable Active Matching
In matching tasks in computer vision, and particularly in real-time tracking from video, there are generally strong priors available on absolute and relative correspondence locati...
Ankur Handa, Margarita Chli, Hauke Strasdat, Andre...
PSIVT
2007
Springer
110views Multimedia» more  PSIVT 2007»
15 years 3 months ago
Measuring Linearity of Ordered Point Sets
It is often practical to measure how linear a certain ordered set of points is. We are interested in linearity measures which are invariant to rotation, scaling, and translation. T...
Milos Stojmenovic, Amiya Nayak
RTSS
2005
IEEE
15 years 3 months ago
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
UmaMaheswari C. Devi, James H. Anderson
IPMI
2005
Springer
15 years 3 months ago
Robust Nonrigid Multimodal Image Registration Using Local Frequency Maps
Automatic multi-modal image registration is central to numerous tasks in medical imaging today and has a vast range of applications e.g., image guidance, atlas construction, etc. ...
Bing Jian, Baba C. Vemuri, José L. Marroqu&...
ICS
2004
Tsinghua U.
15 years 3 months ago
Applications of storage mapping optimization to register promotion
Storage mapping optimization is a flexible approach to folding array dimensions in numerical codes. It is designed to reduce the memory footprint after a wide spectrum of loop tr...
Patrick Carribault, Albert Cohen