Sciweavers

3299 search results - page 160 / 660
» A general mathematics of names
Sort
View
ICPR
2008
IEEE
16 years 7 months ago
Nonlocal morphological levelings by partial difference equations over weighted graphs
In this paper, a novel approach to Mathematical Morphology operations is proposed. Morphological operators based on partial differential equations (PDEs) are extended to weighted ...
Vinh-Thong Ta, Abderrahim Elmoataz, Olivier Lezora...
WWW
2005
ACM
16 years 7 months ago
Soundness proof of Z semantics of OWL using institutions
The correctness of the Z semantics of OWL is the theoretical foundation of using software engineering techniques to verify Web ontologies. As OWL and Z are based on different logi...
Dorel Lucanu, Yuan-Fang Li, Jin Song Dong
RECOMB
2004
Springer
16 years 6 months ago
Finding approximate tandem repeats in genomic sequences
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range...
Ydo Wexler, Zohar Yakhini, Yechezkel Kashi, Dan Ge...
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 6 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
ICFP
2003
ACM
16 years 6 months ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish