9842 search results - page 1493 / 1969 » The Complexity of the Matching-Cut Problem |
163
click to vote
EVOW
2010
Springer
16 years 3 days ago
2010
Springer
In this paper we report on the synthesis of sounds using cellular automata, specifically the multitype voter model. The mapping process adopted is based on digital signal processin...
163
click to vote
COMPGEOM
2010
ACM
16 years 2 days ago
2010
ACM
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
176
click to vote
PODS
2010
ACM
16 years 1 days ago
2010
ACM
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
176
click to vote
CA
2002
IEEE
15 years 12 months ago
2002
IEEE
Virtual conversational agents are supposed to combine speech with nonverbal modalities for intelligible and believeable utterances. However, the automatic synthesis of coverbal ge...
165
click to vote
COOPIS
2002
IEEE
15 years 12 months ago
2002
IEEE
Abstract. Today’s software systems have to deal with an increasing diversity and complexity of execution environments. Next generation applications will have to deal with the unk...