Sciweavers

882 search results - page 66 / 177
» On self-embeddings of computable linear orderings
Sort
View
COMPUTING
2004
115views more  COMPUTING 2004»
14 years 9 months ago
Length Preserving Multiresolution Editing of Curves
In this paper a method for multiresolution deformation of planar piecewise linear curves that preserves the curve length is presented. In a wavelet based multiresolution editing f...
Basile Sauvage, Stefanie Hahmann, Georges-Pierre B...
INFORMS
1998
150views more  INFORMS 1998»
14 years 9 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
15 years 2 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
ICPR
2008
IEEE
15 years 11 months ago
Vector field resampling using local streamline approximation
In this paper, we propose an algorithm to resample coarse vector fields in order to obtain vector fields of a higher density. Unlike the typical linear interpolation scheme, our a...
Mani Thomas, Chandra Kambhamettu, Cathleen A. Geig...
CORR
2011
Springer
161views Education» more  CORR 2011»
14 years 1 months ago
Quadratic Goldreich-Levin Theorems
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
Madhur Tulsiani, Julia Wolf