Sciweavers

6142 search results - page 343 / 1229
» The Complexity of Partition Functions
Sort
View
LOGCOM
2007
92views more  LOGCOM 2007»
15 years 6 months ago
Third-Order Computation and Bounded Arithmetic
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
Alan Skelley
SIAMMA
2011
71views more  SIAMMA 2011»
15 years 1 months ago
Reconstruction of Penetrable Obstacles in Acoustic Scattering
We develop a reconstruction algorithm to determine penetrable obstacles inside a domain in the plane from acoustic measurements made on the boundary. This algorithm uses complex g...
Sei Nagayasu, Gunther Uhlmann, Jenn-Nan Wang
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
16 years 1 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
216
Voted
BCS
2008
15 years 8 months ago
Fast Estimation of Nonparametric Kernel Density Through PDDP, and its Application in Texture Synthesis
In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...
Arnab Sinha, Sumana Gupta
ICIP
2009
IEEE
16 years 7 months ago
Affine Alignment Of Compound Objects: A Direct Approach
A direct approach for parametric estimation of 2D affine deformations between compound shapes is proposed. It provides the result as a least-square solution of a linear system of ...