Sciweavers

4714 search results - page 258 / 943
» The Complexity of Iterated Multiplication
Sort
View
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 5 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
CAD
2007
Springer
15 years 5 months ago
Interpolation by geometric algorithm
We present a novel geometric algorithm to construct a smooth surface that interpolates a triangular or a quadrilateral mesh of arbitrary topological type formed by n vertices. Alt...
Takashi Maekawa, Yasunori Matsumoto, Ken Namiki
142
Voted
JMIV
2007
122views more  JMIV 2007»
15 years 5 months ago
Fast Image Inpainting Based on Coherence Transport
High-quality image inpainting methods based on nonlinear higher-order partial differential equations have been developed in the last few years. These methods are iterative by natur...
Folkmar Bornemann, Tom März
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
15 years 2 days ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas
ICIP
2003
IEEE
16 years 6 months ago
Bayesian parameter estimation in image reconstruction from subsampled blurred observations
In this paper we consider the estimation of the unknown hyperparameters for the problem of reconstructing a high-resolution image from multiple undersampled, shifted, blurred and ...
Miguel Vega, Javier Mateos, Rafael Molina, Aggelos...