257 search results - page 15 / 52 » Computability over The Partial Continuous Functionals |
COCO
2007
Springer
14 years 4 months ago
2007
Springer
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
INFOCOM
2005
IEEE
14 years 3 months ago
2005
IEEE
— Knowing the positions of the nodes in a network is essential to many next generation pervasive and sensor network functionalities. Although many network localization systems ha...
STOC
1991
ACM
14 years 1 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
VIS
2008
IEEE
14 years 11 months ago
2008
IEEE
Abstract--Smooth surface extraction using partial differential equations (PDEs) is a well-known and widely used technique for visualizing volume data. Existing approaches operate o...
LOPSTR
2007
Springer
14 years 4 months ago
2007
Springer
Homeomorphic Embedding (HEm) has proven to be very powerful for supervising termination of computations, provided that such computations are performed over a finite signature, i.e...