150 search results - page 15 / 30 » Counting Results in Weak Formalisms |
BIRTHDAY
2010
Springer
13 years 10 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
STOC
1993
ACM
14 years 26 days ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
IDA
2006
Springer
13 years 8 months ago
2006
Springer
Clustering or co-clustering techniques have been proved useful in many application domains. A weakness of these techniques remains the poor support for grouping characterization. ...
BMCBI
2007
13 years 8 months ago
2007
Background: The precision of transcriptional regulation is made possible by the specificity of physical interactions between transcription factors and their cognate binding sites ...
IJCAI
2001
13 years 10 months ago
2001
ive probabilistic networks are qualitative abstractions of probabilistic networks, summarising probabilistic influences by qualitative signs. As qualitative networks model influen...