Sciweavers

1717 search results - page 57 / 344
» A Computable Spectral Theorem
Sort
View
IGPL
1998
97views more  IGPL 1998»
15 years 3 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
ACCV
2010
Springer
14 years 11 months ago
Four Color Theorem for Fast Early Vision
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
Radu Timofte, Luc J. Van Gool
CAD
2007
Springer
15 years 4 months ago
A spectral approach to shape-based retrieval of articulated 3D models
We present an approach for robust shape retrieval from databases containing articulated 3D models. Each shape is represented by the eigenvectors of an appropriately defined affin...
Varun Jain, Hao Zhang 0002
JSC
2000
68views more  JSC 2000»
15 years 3 months ago
New Structure Theorem for Subresultants
We give a new structure theorem for subresultants precising their gap structure and derive from it a new algorithm for computing them. If d is a bound on the degrees and a bound o...
Henri Lombardi, Marie-Françoise Roy, Mohab ...
MOC
1998
96views more  MOC 1998»
15 years 3 months ago
A convergence theorem for the fast multipole method for 2 dimensional scattering problems
Abstract. The Fast Multipole Method (FMM) designed by V. Rokhlin rapidly computes the field scattered from an obstacle. This computation consists of solving an integral equation o...
Christophe Labreuche