Sciweavers

30 search results - page 4 / 6
» Symmetric approximate linear programming for factored MDPs w...
Sort
View
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 8 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
14 years 1 months ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson
DCC
2003
IEEE
14 years 7 months ago
Linear Programming Optimization for Video Coding under Multiple Constraints
This paper introduces a linear programming (LP) technique that performs ratedistortion based optimization for constrained video coding. Given the assumption of piecewise linear an...
Yegnaswamy Sermadevi, Sheila S. Hemami
CODES
2010
IEEE
13 years 5 months ago
Automatic parallelization of embedded software using hierarchical task graphs and integer linear programming
The last years have shown that there is no way to disregard the advantages provided by multiprocessor System-on-Chip (MPSoC) architectures in the embedded systems domain. Using mu...
Daniel Cordes, Peter Marwedel, Arindam Mallik
AAAI
2000
13 years 8 months ago
Decision Making under Uncertainty: Operations Research Meets AI (Again)
Models for sequential decision making under uncertainty (e.g., Markov decision processes,or MDPs) have beenstudied in operations research for decades. The recent incorporation of ...
Craig Boutilier