Sciweavers

189 search results - page 26 / 38
» From Linear Relaxations to Global Constraint Propagation
Sort
View
CVPR
2001
IEEE
14 years 9 months ago
A Subspace Approach to Layer Extraction
Representing images with layers has many important applications, such as video compression, motion analysis, and 3D scene analysis. This paper presents an approach to reliably ext...
Qifa Ke, Takeo Kanade
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 10 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
CIA
2007
Springer
14 years 1 months ago
Quantifying the Expected Utility of Information in Multi-agent Scheduling Tasks
Abstract. In this paper we investigate methods for analyzing the expected value of adding information in distributed task scheduling problems. As scheduling problems are NP-complet...
Avi Rosenfeld, Sarit Kraus, Charlie Ortiz
PLDI
2011
ACM
12 years 10 months ago
A case for an SC-preserving compiler
The most intuitive memory consistency model for shared-memory multi-threaded programming is sequential consistency (SC). However, current concurrent programming languages support ...
Daniel Marino, Abhayendra Singh, Todd D. Millstein...
WACV
2005
IEEE
14 years 1 months ago
Epipolar Constraints for Vision-Aided Inertial Navigation
— This paper describes a new method to improve inertial navigation using feature-based constraints from one or more video cameras. The proposed method lengthens the period of tim...
David D. Diel, Paul DeBitetto, Seth J. Teller