2845 search results - page 103 / 569 » Constraints over Ontologies |
163
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
201
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
195
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Predictive classification on the base of gene expression profiles appeared recently as an attractive strategy for identifying the biological functions of genes. Gene O...
172
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: The development of software tools that analyze microarray data in the context of genetic knowledgebases is being pursued by multiple research groups using different me...
164
click to vote
CONCUR
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We extend cc to allow the specification of a discrete probability distribution for random variables. We demonstrate the expressiveness of pcc by synthesizing combinators...