Sciweavers

1087 search results - page 86 / 218
» Generation under Space Constraints
Sort
View
AIPS
2004
15 years 6 months ago
Heuristic Refinements of Approximate Linear Programming for Factored Continuous-State Markov Decision Processes
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
Branislav Kveton, Milos Hauskrecht
DL
2000
Springer
156views Digital Library» more  DL 2000»
15 years 9 months ago
Re-engineering structures from Web documents
To realise a wide range of applications (including digital libraries) on the Web, a more structured way of accessing the Web is required and such requirement can be facilitated by...
Chuang-Hue Moh, Ee-Peng Lim, Wee Keong Ng
132
Voted
ICMCS
2010
IEEE
146views Multimedia» more  ICMCS 2010»
15 years 5 months ago
Privacy-preserving approximation of L1 distance for multimedia applications
Alice and Bob possess sequences x and y respectively and would like to compute the 1 distance, namely x - y 1 under privacy and communication constraints. The privacy constraint r...
Shantanu Rane, Wei Sun, Anthony Vetro
CVPR
2009
IEEE
16 years 11 months ago
Color Estimation from a Single Surface Color
This paper estimates illumination colors by using only a single surface color taken under multiple illumination colors. Past researchers have found that there is a difficulty in ...
Rei Kawakami (The University of Tokyo), Katsushi I...
KR
2004
Springer
15 years 10 months ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang