971 search results - page 78 / 195 » Approximate Satisfiability and Equivalence |
ICPR
2000
IEEE
16 years 1 months ago
2000
IEEE
We present an exact algorithm for the computation of the moments of a region bounded by a curve represented in a scaling function or wavelet basis. Using Green's theorem, we ...
90
Voted
ICCV
2005
IEEE
15 years 6 months ago
2005
IEEE
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
98
Voted
DMTCS
2003
15 years 2 months ago
2003
Let h : N → Q be a computable function. A real number x is h-monotonically computable (h-mc, for short) if there is a computable sequence (xs) of rational numbers which converges...
86
Voted
ISMB
1994
15 years 2 months ago
1994
Weuse a quantitative definition of specificity to developa neural networkfor the identification of commonprotein binding sites in a collection of unaligned DNAfragments. Wedemonst...
96
Voted
IPL
2008
15 years 20 days ago
2008
Generalized Petersen (GP) networks and periodically regular chordal (PRC) rings have been proposed independently to ameliorate the high latency and extreme fragility of simple rin...