824 search results - page 45 / 165 » Constructing Functional Programs for Grammar Analysis Proble... |
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
72
Voted
ENTCS
2006
14 years 9 months ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
IWPC
2009
IEEE
15 years 4 months ago
2009
IEEE
Understanding aspect-oriented systems, without appropriate tool support, is a difficult and a recognized problem in the research community. Surprisingly, little has been done to ...
VRCAI
2004
ACM
15 years 3 months ago
2004
ACM
Despite steady research advances in many aspects of virtual reality, building and testing virtual worlds remains to be a very difficult process. Most virtual environments are stil...
ESOP
2012
Springer
13 years 5 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...