173 search results - page 8 / 35 » Groups with poly-context-free word problem |
116
click to vote
MMS
1998
14 years 9 months ago
1998
This paper explores the problems associated with the multicasting of continuous media to support multimedia group applications. The interaction between multicasting and the deliver...
GC
2006
Springer
14 years 10 months ago
2006
Springer
We give a bound on the reconstructibility of an action G X in terms of the reconstructibility of a the action N X, where N is a normal subgroup of G, and the reconstructibility o...
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
— Many evolutionary algorithms have been proposed for large scale optimization. Parameter interaction in nonseparable problems is a major source of performance loss specially on ...
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. The braid groups are infinite non-commutative groups naturally arising from geometric braids. The aim of this article is twofold. One is to show that the braid groups ca...
ACL
2001
14 years 11 months ago
2001
In this paper, a new language model, the Multi-Class Composite N-gram, is proposed to avoid a data sparseness problem for spoken language in that it is difficult to collect traini...