2125 search results - page 281 / 425 » On Graph Complexity |
POPL
2000
ACM
15 years 2 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
101
click to vote
BPM
2008
Springer
15 years 6 days ago
2008
Springer
We present a field study of oncology workflow, involving doctors, nurses and pharmacists at Danish hospitals and discuss the obstacles, enablers and challenges for the use of compu...
FOGA
2007
14 years 11 months ago
2007
Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes deï...
CDC
2010
IEEE
14 years 5 months ago
2010
IEEE
This work considers the problem of designing optimal multi-agent trajectories to patrol an environment. As performance criterion for optimal patrolling we consider the worst-case t...
129
click to vote
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Local invariant feature based methods have been proven to be effective in computer vision for object recognition and learning. But for an image, the number of points detected and ...