Sciweavers

2080 search results - page 64 / 416
» Measuring empirical computational complexity
Sort
View
JMLR
2012
12 years 12 days ago
Structured Output Learning with High Order Loss Functions
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
Daniel Tarlow, Richard S. Zemel
FOCS
2005
IEEE
14 years 3 months ago
Towards a Final Analysis of Pairing Heaps
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
Seth Pettie
ICRA
2003
IEEE
151views Robotics» more  ICRA 2003»
14 years 3 months ago
Adaptive real-time particle filters for robot localization
— Particle filters have recently been applied with great success to mobile robot localization. This success is mostly due to their simplicity and their ability to represent arbi...
Cody C. T. Kwok, Dieter Fox, Marina Meila
PAMI
2010
162views more  PAMI 2010»
13 years 4 months ago
Differential Earth Mover's Distance with Its Applications to Visual Tracking
The Earth Mover's Distance (EMD) is a similarity measure that captures perceptual difference between two distributions. Its computational complexity, however, prevents a direc...
Qi Zhao, Zhi Yang, Hai Tao
ICISP
2010
Springer
13 years 8 months ago
Correction of Left Ventricle Strain Signals Estimated from Tagged MR Images
Strain measurement is a quantity used for assessing the regional function of the left ventricular (LV) of the heart. They are computed by tracking the motion of the non-invasive, ...
Mina E. Khalil, Ahmed S. Fahmy, Nael F. Osman