Sciweavers

896 search results - page 20 / 180
» On completeness of word reversing
Sort
View
CSB
2004
IEEE
113views Bioinformatics» more  CSB 2004»
13 years 11 months ago
Shannon Information in Complete Genomes
Shannon information in the genomes of all completely sequenced prokaryotes and eukaryotes are measured in word lengths of two to ten letters. It is found that in a scale-dependent...
Chang-Heng Chang, Li-Ching Hsieh, Ta-Yuan Chen, Ho...
APAL
2007
79views more  APAL 2007»
13 years 7 months ago
A completeness result for a realisability semantics for an intersection type system
In this paper we consider a type system with a universal type ω where any term (whether open or closed, β-normalising or not) has type ω. We provide this type system with a rea...
Fairouz Kamareddine, Karim Nour
ICDE
2009
IEEE
130views Database» more  ICDE 2009»
14 years 9 months ago
A Latent Topic Model for Complete Entity Resolution
In bibliographies like DBLP and Citeseer, there are three kinds of entity-name problems that need to be solved. First, multiple entities share one name, which is called the name sh...
Liangcai Shu, Bo Long, Weiyi Meng
LATIN
2004
Springer
14 years 23 days ago
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces
The paper settles a long standing problem for Mazurkiewicz traces: the pure future local temporal logic defined with the basic modalities exists-next and until is expressively com...
Volker Diekert, Paul Gastin
ACS
2008
13 years 7 months ago
On Non-M-Cosingular Completely (+)-Supplemented Modules
In this paper, it is shown that any non-M-cosingular -supplemented module M is (D3) if and only if M has the summand intersection property. Let N [M ] be any module such that Z M(...
Derya Keskin Tütüncü