Sciweavers

6274 search results - page 22 / 1255
» From query complexity to computational complexity
Sort
View
COMPGEOM
2005
ACM
13 years 11 months ago
Inclusion-exclusion formulas from independent complexes
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
Dominique Attali, Herbert Edelsbrunner
ENTCS
2006
153views more  ENTCS 2006»
13 years 9 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu
UAI
2004
13 years 11 months ago
Sensitivity Analysis in Bayesian Networks: From Single to Multiple Parameters
Previous work on sensitivity analysis in Bayesian networks has focused on single parameters, where the goal is to understand the sensitivity of queries to single parameter changes...
Hei Chan, Adnan Darwiche
ICIAR
2005
Springer
14 years 3 months ago
Determining Multiscale Image Feature Angles from Complex Wavelet Phases
In this paper, we introduce a new multiscale representation for 2-D images named the Inter-Coefficient Product (ICP). The ICP is a decimated pyramid of complex values based on the ...
Ryan Anderson, Nick G. Kingsbury, Julien Fauqueur
BSL
2008
97views more  BSL 2008»
13 years 10 months ago
The Complexity of Orbits of Computably Enumerable Sets
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
Peter Cholak, Rodney G. Downey, Leo Harrington