182 search results - page 35 / 37 » A Theory of Strict P-completeness |
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
DLOG
2008
13 years 10 months ago
2008
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
GECCO
1999
Springer
13 years 11 months ago
1999
Springer
This paper discusses the simulation results of a model of biological development for neural networks based on a regulatory genome. The model’s results are analyzed using the fra...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
AAAI
2010
13 years 9 months ago
2010
Recent research has shown that surprisingly rich models of human behavior can be learned from GPS (positional) data. However, most research to date has concentrated on modeling si...