Sciweavers

33 search results - page 1 / 7
» Coincidences Are not Accidental: a Theorem
Sort
View
CAS
1999
60views more  CAS 1999»
13 years 7 months ago
Coincidences Are not Accidental: a Theorem
In this paper, we formalize and prove the statement that coincidences cannot be accidental, a statement that underlies many useful heuristics in mathematics and physics. Our proof...
Vladik Kreinovich
MVA
2002
144views Computer Vision» more  MVA 2002»
13 years 7 months ago
Fingerprint Identification Using the Accidental Coincidence Probability
A method of comparing and identifying two patterns is proposed based on the accidental coincidence probability of the patterns' features. The probability is calculated under ...
Akira Monden, Seiji Yoshimoto
LATA
2009
Springer
14 years 2 months ago
A Kleene Theorem for Forest Languages
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
Lutz Straßburger
JCSS
1998
74views more  JCSS 1998»
13 years 7 months ago
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...
Manindra Agrawal, Eric Allender, Steven Rudich
ENTCS
2002
105views more  ENTCS 2002»
13 years 7 months ago
Fixed points in digital topology (via Helly posets)
Abstract. We extend some of our previous results on fixed points of graph multifunctions to posets. The posets of most interest here are the (finite) Khalimsky spaces, in their spe...
Rueiher Tsaur, Michael B. Smyth