99 search results - page 18 / 20 » Inspection by Implicit Polynomials |
CPM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
CIMAGING
2008
14 years 11 months ago
2008
The Non-Local Means (NLM) method of denoising has received considerable attention in the image processing community due to its performance, despite its simplicity. In this paper, ...
AAAI
2006
14 years 11 months ago
2006
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
COMGEO
2010
ACM
14 years 10 months ago
2010
ACM
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
ECCC
2010
14 years 10 months ago
2010
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...