1693 search results - page 255 / 339 » fast 2008 |
CADE
2008
Springer
14 years 10 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
ASPDAC
2008
ACM
14 years 1 days ago
2008
ACM
Nowadays a placement problem often involves multi-million objects and excessive fixed blockages. We present a new global placement algorithm that scales well to the modern large-s...
CJ
2010
13 years 7 months ago
2010
an be used to abstract away from the physical reality by describing it as components that exist in discrete states with probabilistically invoked actions that change the state. The...
BMCBI
2008
13 years 10 months ago
2008
Background: One of the difficulties in mapping biomedical named entities, e.g. genes, proteins, chemicals and diseases, to their concept identifiers stems from the potential varia...
CVPR
2008
IEEE
15 years 1 days ago
2008
IEEE
In this paper, we propose a novel dynamic discrete framework to address image morphing with application to optical flow estimation. We reformulate the problem using a number of di...