2542 search results - page 58 / 509 » Computing Cartograms with Optimal Complexity |
ECP
1997
Springer
14 years 1 months ago
1997
Springer
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
JSA
2000
13 years 8 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
SIGIR
2012
ACM
11 years 11 months ago
2012
ACM
In this paper, we tackle the problem of top-N context-aware recommendation for implicit feedback scenarios. We frame this challenge as a ranking problem in collaborative filterin...
ICIP
2007
IEEE
14 years 10 months ago
2007
IEEE
Interactive navigation in image-based scenes requires random access to the compressed reference image data. When using state of the art block-based hybrid video coding techniques,...