20441 search results - page 134 / 4089 » Locally Computable Structures |
ALMOB
2006
14 years 12 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
LMCS
2006
14 years 11 months ago
2006
tract Stone Duality) is a re-axiomatisation of general topology in which the topology on a space is treated, not as an infinitary lattice, but as an exponential object of the same...
129
click to vote
ICDE
2012
IEEE
13 years 2 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
63
Voted
ACL
2004
15 years 1 months ago
2004
We present the first algorithm that computes optimal orderings of sentences into a locally coherent discourse. The algorithm runs very efficiently on a variety of coherence measur...
100
click to vote
IJFCS
2006
14 years 11 months ago
2006
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...