Sciweavers

174 search results - page 7 / 35
» Fast equation automaton computation
Sort
View
VLSM
2005
Springer
15 years 5 months ago
Fast Marching Method for Generic Shape from Shading
We develop a fast numerical method to approximate the solutions of a wide class of equations associated to the Shape From Shading problem. Our method, which is based on the control...
Emmanuel Prados, Stefano Soatto
CSR
2007
Springer
15 years 6 months ago
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
Abstract It has recently been proved (Je˙z, DLT 2007) that conjunctive grammars (that is, context-free grammars augmented by conjunction) generate some nonregular languages over a...
Artur Jez, Alexander Okhotin
DAC
2009
ACM
15 years 3 months ago
GPU friendly fast Poisson solver for structured power grid network analysis
In this paper, we propose a novel simulation algorithm for large scale structured power grid networks. The new method formulates the traditional linear system as a special two-dim...
Jin Shi, Yici Cai, Wenting Hou, Liwei Ma, Sheldon ...

Publication
2630views
16 years 11 months ago
DIJKSTRA’S and Fast Marching Method for Optimal Path Planning
This technical report illustrates the differences in solving the optimal path problem (shortest path) using different methods, where the underlying PDE can be described by the eik...
RYO TAKEI

Publication
683views
16 years 11 months ago
A Variational Formulation of the Fast Marching Eikonal Solver
A very nice paper by Prof. Sergey Fomel in which he shows that the eikonal equation can be derived from the Fermat’s principle using variational formulation.
Sergey Fomel1