Sciweavers

316 search results - page 13 / 64
» Expressiveness of graph conditions with variables
Sort
View
SIGSOFT
1994
ACM
15 years 1 months ago
A New Model of Program Dependences for Reverse Engineering
A dependence model for reverse engineering should treat procedures in a modular fashion and should be fine-grained, distinguishing dependences that are due to different variables....
Daniel Jackson, Eugene J. Rollins
VLDB
1990
ACM
116views Database» more  VLDB 1990»
15 years 1 months ago
Factoring Augmented Regular Chain Programs
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use o...
Peter T. Wood
BMCBI
2008
122views more  BMCBI 2008»
14 years 9 months ago
Determining gene expression on a single pair of microarrays
Background: In microarray experiments the numbers of replicates are often limited due to factors such as cost, availability of sample or poor hybridization. There are currently fe...
Robert W. Reid, Anthony A. Fodor
ICIP
2004
IEEE
15 years 11 months ago
Separating useful from useless image variation for face recognition
For a general purpose face recognition system one of the largest challenge is to separate useful identity related from useless variations in the image data due to nuisance variabl...
Peter Kalocsai
AAAI
2008
14 years 12 months ago
Dormant Independence
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...
Ilya Shpitser, Judea Pearl