316 search results - page 11 / 64 » Expressiveness of graph conditions with variables |
BMCBI
2006
14 years 9 months ago
2006
Background: Microarray technology produces gene expression data on a genomic scale for an endless variety of organisms and conditions. However, this vast amount of information nee...
FSTTCS
2003
Springer
15 years 2 months ago
2003
Springer
For monoids that satisfy a weak cancellation condition, it is shown that the decidability of the existential theory of word equations is preserved under graph products. Furthermore...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper, the use of closed-form expressions is compared to the BIC approximation, with respect to speaker clustering. We first show that the particular BIC setting which is...
GG
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
74
Voted
VLDB
1989
ACM
15 years 1 months ago
1989
ACM
Graphical Direct Manipulation (GrDM) query languagesare characterized and positioned with respect to traditional textual query languages. After a brief survey of the current state...