Sciweavers

358 search results - page 53 / 72
» Sparse squares of polynomials
Sort
View
ICPR
2000
IEEE
15 years 8 months ago
Boundary Estimation from Intensity/Color Images with Algebraic Curve Models
A new concept and algorithm are presented for noniterative robust estimation of piecewise smooth curves of maximal edge strength in small image windows – typically  ¢¡£  to...
Tolga Tasdizen, David B. Cooper
SGP
2007
15 years 6 months ago
Data-dependent MLS for faithful surface approximation
In this paper we present a high-fidelity surface approximation technique that aims at a faithful reconstruction of piecewise-smooth surfaces from a scattered point set. The presen...
Yaron Lipman, Daniel Cohen-Or, David Levin
SDM
2007
SIAM
106views Data Mining» more  SDM 2007»
15 years 5 months ago
Approximating Representations for Large Numerical Databases
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
Szymon Jaroszewicz, Marcin Korzen
APPROX
2009
Springer
136views Algorithms» more  APPROX 2009»
15 years 10 months ago
Succinct Representation of Codes with Applications to Testing
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
Elena Grigorescu, Tali Kaufman, Madhu Sudan
ICALP
2007
Springer
15 years 10 months ago
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...