Sciweavers

71 search results - page 6 / 15
» On the Complexity of Reliable Root Approximation
Sort
View
TVCG
2010
162views more  TVCG 2010»
14 years 10 months ago
Computing Robustness and Persistence for Images
—We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology c...
Paul Bendich, Herbert Edelsbrunner, Michael Kerber
130
Voted
ATAL
1997
Springer
15 years 3 months ago
Approximate Reasoning about Combined Knowledge
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
Frédéric Koriche

Publication
222views
15 years 8 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
ICIP
2001
IEEE
16 years 1 months ago
Robust estimation of depth and motion using stochastic approximation
The problemof structurefrom motion (SFM)is to extract the three-dimensionalmodel of a moving scene from a sequence of images. Though two images are sufficient to produce a 3D reco...
Rama Chellappa, Amit K. Roy Chowdhury
ICASSP
2008
IEEE
15 years 6 months ago
Collusion-aware traitor tracing in multimedia fingerprinting using sparse signal approximation
We pose the problem of tracing traitors, who have colluded to circumvent a multimedia fingerprinting system, as a sparse underdetermined linear problem. We propose a range of det...
David P. Varodayan, Christine Pépin