338 search results - page 34 / 68 » On the Complexity of Termination Inference for Processes |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Anticipating and characterizing damages in layered carbon fiberreinforced polymers is a challenging problem. Non-destructive evaluation using ultrasonic signals is a well-establi...
101
click to vote
ACL
2011
14 years 1 months ago
2011
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
ICAC
2007
IEEE
15 years 4 months ago
2007
IEEE
System-S is a stream processing infrastructure which enables program fragments to be distributed and connected to form complex applications. There may be potentially tens of thous...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
White-box testing is an important method for the early detection of errors during software development. In this process test case generation plays a crucial role, defining appropr...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...