Sciweavers

3690 search results - page 196 / 738
» Computation with classical sequents
Sort
View
MCS
2007
Springer
15 years 16 days ago
Discrete conservation of nonnegativity for elliptic problems solved by the hp-FEM
Most results related to discrete nonnegativity conservation principles (DNCP) for elliptic problems are limited to finite differences (FDM) and lowest-order finite element meth...
Pavel Solín, Tomás Vejchodský...
100
Voted
IVC
2000
175views more  IVC 2000»
15 years 14 days ago
Uncalibrated Euclidean reconstruction: a review
This paper provides a review on techniques for computing a three-dimensional model of a scene from a single moving camera, with unconstrained motion and unknown parameters. In the...
Andrea Fusiello
MFCS
2010
Springer
14 years 11 months ago
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
Stefan Kratsch, Dániel Marx, Magnus Wahlstr...
SPAA
2010
ACM
14 years 11 months ago
Managing the complexity of lookahead for LU factorization with pivoting
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) usin...
Ernie Chan, Robert A. van de Geijn, Andrew Chapman
97
Voted
ICPR
2010
IEEE
14 years 10 months ago
Multiscale Analysis from 1D Parametric Geometric Decomposition of Shapes
This paper deals with the construction of a non parametric multiscale analysis from a 1D parametric decomposition of shapes where the elements of the decomposition are geometric p...
Fabien Feschet