Sciweavers

1362 search results - page 80 / 273
» Means, Correlations and Bounds
Sort
View
JUCS
2010
113views more  JUCS 2010»
14 years 8 months ago
Isometries and Computability Structures
: We investigate the relationship between computable metric spaces (X, d, ) and (X, d, ), where (X, d) is a given metric space. In the case of Euclidean space, and are equivalent ...
Zvonko Iljazovic
90
Voted
DAGSTUHL
2007
15 years 3 months ago
Uniqueness of Optimal Mod 3 Circuits for Parity
In this paper, we prove that the quadratic polynomials modulo 3 with the largest correlation with parity are unique up to permutation of variables and constant factors. As a conseq...
Frederic Green, Amitabha Roy
ECCV
2004
Springer
16 years 3 months ago
Dynamic Visual Search Using Inner-Scene Similarity: Algorithms and Inherent Limitations
Abstract. A dynamic visual search framework based mainly on innerscene similarity is proposed. Algorithms as well as measures quantifying the difficulty of search tasks are suggest...
Tamar Avraham, Michael Lindenbaum
120
Voted
ASPDAC
2008
ACM
174views Hardware» more  ASPDAC 2008»
15 years 3 months ago
Chebyshev Affine Arithmetic based parametric yield prediction under limited descriptions of uncertainty
In modern circuit design, it is difficult to provide reliable parametric yield prediction since the real distribution of process data is hard to measure. Most existing approaches ...
Jin Sun, Yue Huang, Jun Li, Janet Meiling Wang
JAIR
1998
92views more  JAIR 1998»
15 years 1 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson