We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...
CLaRK is an XML-based software system for corpora development. It incorporates several technologies: XML technology; Unicode; Regular Cascaded Grammars; Constraints over XML Docum...
Kiril Ivanov Simov, Alexander Simov, Milen Kouylek...
In the past decade, information theory has been studied extensively in computational imaging. In particular, image matching by maximizing mutual information has been shown to yiel...
Igor Yanovsky, Paul M. Thompson, Stanley Osher, Al...
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...
Abstract. This paper presents a new registration method called Transitive InverseConsistent Manifold Registration (TICMR). The TICMR method jointly estimates correspondence maps be...