Sciweavers

330 search results - page 35 / 66
» Approximation Algorithms for the Directed k-Tour and k-Strol...
Sort
View
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
14 years 1 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
IJCAI
1997
13 years 10 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
CVPR
2003
IEEE
14 years 10 months ago
Constrained Subspace Modelling
When performing subspace modelling of data using Principal Component Analysis (PCA) it may be desirable to constrain certain directions to be more meaningful in the context of the...
Jaco Vermaak, Patrick Pérez
PAMI
2010
248views more  PAMI 2010»
13 years 7 months ago
Coupled Prediction Classification for Robust Visual Tracking
—This paper addresses the problem of robust template tracking in image sequences. Our work falls within the discriminative framework in which the observations at each frame yield...
Ioannis Patras, Edwin R. Hancock
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
14 years 6 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...