743 search results - page 146 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
ISMIR
2005
Springer
14 years 1 months ago
2005
Springer
We introduce a new model for extracting classified structural segments, such as intro, verse, chorus, break and so forth, from recorded music. Our approach is to classify signal ...
CONCUR
2000
Springer
14 years 2 days ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
RC
2000
13 years 7 months ago
2000
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...