13457 search results - page 71 / 2692 » Can we elect if we cannot compare |
CSL
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...
GCB
2006
Springer
13 years 11 months ago
2006
Springer
: The analysis of small circular sequences requires specialized tools. While the differences between linear and circular sequences can be neglected in the case of long molecules su...
ISMIS
2000
Springer
13 years 11 months ago
2000
Springer
There is current interest in generalizing Bayesian networks by using dependencies which are more general than probabilistic conditional independence (CI). Contextual dependencies, ...
LREC
2008
13 years 9 months ago
2008
In this paper we present two experiments conducted for comparison of different language identification algorithms. Short words-, frequent words- and n-gram-based approaches are co...
GI
2010
Springer
13 years 6 months ago
2010
Springer
: A recurring manual task in data integration or ontology alignment is finding mappings between complex schemas. In order to reduce the manual effort, many matching algorithms for ...