1734 search results - page 72 / 347 » its 2000 |
MFCS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
SAS
2000
Springer
15 years 1 months ago
2000
Springer
Design constraints express essential behavioural properties of a software system. Two key elements of a scheme for enforcing design constraints are presented: a logic for describin...
STACS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
TACAS
2000
Springer
15 years 1 months ago
2000
Springer
Conformance testing is still the main industrial validation technique for telecommunication protocols. The automatic construction of test cases based on the model approach is hinde...
ACL
2008
14 years 11 months ago
2008
The paper presents a novel sentence trimmer in Japanese, which combines a non-statistical yet generic tree generation model and Conditional Random Fields (CRFs), to address improv...