11151 search results - page 133 / 2231 » On the Complexity of Model Expansion |
142
click to vote
JUCS
2002
15 years 4 months ago
2002
: We consider disjunctive sequences, that is, infinite sequences (-words) having all finite words as infixes. It is shown that the set of all disjunctive sequences can be described...
234
click to vote
GIS
2004
ACM
16 years 5 months ago
2004
ACM
Motivated by the increasing need to handle complex multidimensional data in location-based data warehouses, this paper proposes a powerful data model that is able to capture the c...
130
click to vote
CSC
2008
15 years 6 months ago
2008
Complex network models such as Kauffman's NK model have been shown to have interesting phase transitional properties as the connectivity is varied. Conventional network and g...
142
click to vote
ICANN
2007
Springer
15 years 8 months ago
2007
Springer
We present an artificial neural network used to learn online complex temporal sequences of gestures to a robot. The system is based on a simple temporal sequences learning architec...
127
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...