2031 search results - page 144 / 407 » On Tree-Constrained Matchings and Generalizations |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
DCG
2010
14 years 10 months ago
2010
We show that the cyclic lamplighter group C2 Cn embeds into Hilbert space with distortion O log n . This matches the lower bound proved by Lee, Naor and Peres in [14], answering a...
ENTCS
2008
14 years 10 months ago
2008
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
BIOINFORMATICS
2006
14 years 10 months ago
2006
Motivation: The need for normalization in microarray experiments has been well documented in the literature. Currently, most analysis methods treat normalization and analysis as a...
GIS
2008
ACM
14 years 10 months ago
2008
ACM
This paper introduces an ant-based colony system for the representation of a verbal route description. It is grounded on a natural metaphor that mimics the behavior of ant colonie...