Sciweavers

1071 search results - page 156 / 215
» Protein structure search and local structure characterizatio...
Sort
View
WIA
2007
Springer
14 years 2 months ago
Analyzing Ambiguity of Context-Free Grammars
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...
Claus Brabrand, Robert Giegerich, Anders Mø...
HT
1996
ACM
14 years 27 days ago
Automatic Text Decomposition Using Text Segments and Text Themes
With the widespread use of full-text information retrieval, passage-retrieval techniques are becoming increasingly popular. Larger texts can then be replaced by important text exc...
Gerard Salton, Amit Singhal, Chris Buckley, Mandar...
FUIN
2002
63views more  FUIN 2002»
13 years 8 months ago
Probabilistic Cluster Unfoldings
Abstract. This article introduces probabilistic cluster branching processes, a probabilistic unfolding semantics for untimed Petri nets, with no structural or safety assumptions, g...
Stefan Haar
JUCS
2002
79views more  JUCS 2002»
13 years 8 months ago
Some Notes on Fine Computability
: A metric defined by Fine induces a topology on the unit interval which is strictly stronger than the ordinary Euclidean topology and which has some interesting applications in Wa...
Vasco Brattka
MLQ
2007
111views more  MLQ 2007»
13 years 8 months ago
On n-contractive fuzzy logics
It is well known that MTL satisfies the finite embeddability property. Thus MTL is complete w.r.t. the class of all finite MTL-chains. In order to reach a deeper understanding ...
Rostislav Horcík, Carles Noguera, Milan Pet...