7106 search results - page 449 / 1422 » Restricted Complexity, General Complexity |
217
click to vote
RTA
2005
Springer
16 years 1 months ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
200
click to vote
SEMWEB
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. Ontology alignment is a prerequisite in order to allow for interoperation between different ontologies and many alignment strategies have been proposed to facilitate the ...
172
click to vote
TACAS
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
206
click to vote
VLDB
2005
ACM
16 years 1 months ago
2005
ACM
A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one ...
183
click to vote
WG
2005
Springer
16 years 1 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...