1132 search results - page 102 / 227 » Structural Average Case Complexity |
108
click to vote
STACS
2007
Springer
15 years 7 months ago
2007
Springer
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n+1 distinct subtrees of height n for each n. As for the case of words, S...
108
click to vote
ANTS
2004
Springer
15 years 7 months ago
2004
Springer
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
IICS
2001
Springer
15 years 6 months ago
2001
Springer
In our terminology, a “deliberation” is a distributed collaborative process, more or less spontaneous, structured, and complex. This process can include both individual and col...
ACL
1998
15 years 3 months ago
1998
We present two approaches for syntactic and semantic transfer based on LFG f-structures and compare the results with existing co-description and restriction operator based approac...
112
click to vote
ICSEA
2008
IEEE
15 years 8 months ago
2008
IEEE
Despite progress in model engineering, modeling large distributed systems is still a long and complex task. This paper outlines a methodology based on UML to make the modeling of ...