6045 search results - page 921 / 1209 » Computable Linearizations of Well-partial-orderings |
155
Voted
JCSS
2008
15 years 6 months ago
2008
The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the ...
183
click to vote
DAM
2007
15 years 6 months ago
2007
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
171
click to vote
JMLR
2006
15 years 6 months ago
2006
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
183
click to vote
MP
2008
15 years 6 months ago
2008
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...
141
click to vote
JUCS
2006
15 years 6 months ago
2006
: Behavioural specifications allow to focus only on the"observable" behaviour of objects. These observations are made through "observable contexts" which are pa...