1478 search results - page 87 / 296 » Modular Complexity Analysis via Relative Complexity |
POPL
2012
ACM
12 years 4 months ago
2012
ACM
We propose a general formal model of isolated hierarchical parallel computations, and identify several fragments to match the concurrency constructs present in real-world programm...
AAAI
1994
13 years 10 months ago
1994
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...
CIE
2006
Springer
14 years 24 days ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
PASTE
2010
ACM
14 years 21 days ago
2010
ACM
ROADRUNNER is a dynamic analysis framework designed to facilitate rapid prototyping and experimentation with dynamic analyses for concurrent Java programs. It provides a clean API...
BMCBI
2011
13 years 4 months ago
2011
Background: Phyloinformatic analyses involve large amounts of data and metadata of complex structure. Collecting, processing, analyzing, visualizing and summarizing these data and...