2612 search results - page 274 / 523 » Switching Graphs and Their Complexity |
154
click to vote
MSE
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper we describe an authoring environment which allows the author to set up and test a complex multimedia presentation by defining the synchronization relationships amon...
121
click to vote
LATIN
1998
Springer
15 years 9 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
119
Voted
NAACL
2003
15 years 6 months ago
2003
We describe a simple unsupervised technique for learning morphology by identifying hubs in an automaton. For our purposes, a hub is a node in a graph with in-degree greater than o...
139
click to vote
RSA
2006
15 years 5 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
167
click to vote
FSTTCS
2010
Springer
15 years 3 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...