225 search results - page 44 / 45 » From polynomial time queries to graph structure theory |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
AI
2007
Springer
13 years 5 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
TOPLAS
2008
13 years 5 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
ASUNAM
2010
IEEE
13 years 6 months ago
2010
IEEE
—To understand the diffusive spreading of a product in a telecom network, whether the product is a service, handset, or subscription, it can be very useful to study the structure...
ISMIR
2004
Springer
13 years 11 months ago
2004
Springer
Measuring the similarity between rhythms is a fundamental problem in computational music theory, with many applications such as music information retrieval and copyright infringem...