20441 search results - page 134 / 4089 » Locally Computable Structures |
107
click to vote
ALMOB
2006
15 years 1 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...
111
click to vote
LMCS
2006
15 years 1 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...
150
click to vote
ICDE
2012
IEEE
13 years 4 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...
75
Voted
ACL
2004
15 years 3 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...
119
click to vote
IJFCS
2006
15 years 1 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...