Sciweavers

1819 search results - page 1 / 364
» Computability and Representations of the Zero Set
Sort
View
ENTCS
2008
106views more  ENTCS 2008»
13 years 5 months ago
Computability and Representations of the Zero Set
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
Pieter Collins
SAC
2006
ACM
13 years 11 months ago
Pseudozero set of interval polynomials
Interval polynomials are useful to describe perturbed polynomials. We present a graphical tool to describe how perturbations of the polynomial coefficients affect its zeros witho...
Stef Graillat, Philippe Langlois
SIAMNUM
2010
87views more  SIAMNUM 2010»
12 years 11 months ago
A Note on the Computation of All Zeros of Simple Quaternionic Polynomials
Polynomials with quaternionic coefficients located on only one side of the powers (we call them simple polynomials) may have two different types of zeros: isolated and spherical ze...
Drahoslava Janovská, Gerhard Opfer
ICCV
2003
IEEE
14 years 6 months ago
Shape Representation via Harmonic Embedding
We present a novel representation of shape for closed planar contours explicitly designed to possess a linear structure. This greatly simplifies linear operations such as averagin...
Alessandro Duci, Anthony J. Yezzi, Sanjoy K. Mitte...
ECCV
2004
Springer
14 years 6 months ago
Sparse Finite Elements for Geodesic Contours with Level-Sets
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
Martin Weber, Andrew Blake, Roberto Cipolla