Sciweavers

365 search results - page 15 / 73
» Solving the Multiplication Constraint in Several Approximati...
Sort
View
JAR
2008
81views more  JAR 2008»
13 years 7 months ago
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal...
Mark H. Liffiton, Karem A. Sakallah
ICPR
2008
IEEE
14 years 9 months ago
Human appearance matching across multiple non-overlapping cameras
In this paper, we present a new solution to the problem of appearance matching across multiple nonoverlapping cameras. Objects of interest, pedestrians are represented by a set of...
Kaiqi Huang, Tieniu Tan, Yinghao Cai
ATAL
2005
Springer
14 years 1 months ago
A polynomial algorithm for decentralized Markov decision processes with temporal constraints
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
Aurélie Beynier, Abdel-Illah Mouaddib
PODS
2009
ACM
100views Database» more  PODS 2009»
14 years 8 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
AAAI
2004
13 years 9 months ago
Regrets Only! Online Stochastic Optimization under Time Constraints
This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/...
Russell Bent, Pascal Van Hentenryck