168 search results - page 12 / 34 » Ontology Change Detection Using a Version Log |
ISAAC
2001
Springer
13 years 12 months ago
2001
Springer
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
HPCA
2006
IEEE
14 years 7 months ago
2006
IEEE
Transactional memory (TM) simplifies parallel programming by guaranteeing that transactions appear to execute atomically and in isolation. Implementing these properties includes p...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
BMCBI
2008
13 years 7 months ago
2008
Background: This paper describes the design of an event ontology being developed for application in the machine understanding of infectious disease-related events reported in natu...
PPPJ
2009
ACM
14 years 2 months ago
2009
ACM
Dynamic compilers can optimize application code specifically for observed code behavior. Such behavior does not have to be stable across the entire program execution to be bene...