Sciweavers

1957 search results - page 199 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
NPAR
2010
ACM
15 years 3 months ago
Stylized depiction of images based on depth perception
Recent works in image editing are opening up new possibilities to manipulate and enhance input images. Within this context, we leverage well-known characteristics of human percept...
Jorge Lopez-Moreno, Jorge Jimenez, Sunil Hadap, Er...
112
Voted
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
15 years 2 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
CVPR
2008
IEEE
14 years 12 months ago
Photometric stereo with coherent outlier handling and confidence estimation
In photometric stereo a robust method is required to deal with outliers, such as shadows and non-Lambertian reflections. In this paper we rely on a probabilistic imaging model tha...
Frank Verbiest, Luc J. Van Gool
80
Voted
IJCAI
2007
14 years 11 months ago
Improving Anytime Point-Based Value Iteration Using Principled Point Selections
Planning in partially-observable dynamical systems (such as POMDPs and PSRs) is a computationally challenging task. Popular approximation techniques that have proved successful ar...
Michael R. James, Michael E. Samples, Dmitri A. Do...
IPCO
2007
98views Optimization» more  IPCO 2007»
14 years 11 months ago
Scheduling with Precedence Constraints of Low Fractional Dimension
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
Christoph Ambühl, Monaldo Mastrolilli, Nikola...