Sciweavers

379 search results - page 16 / 76
» Strong reducibility of partial numberings
Sort
View
BIRD
2008
Springer
141views Bioinformatics» more  BIRD 2008»
13 years 9 months ago
Nested q-Partial Graphs for Genetic Network Inference from "Small n, Large p" Microarray Data
Abstract. Gaussian graphical models are widely used to tackle the important and challenging problem of inferring genetic regulatory networks from expression data. These models have...
Kevin Kontos, Gianluca Bontempi
OOPSLA
1998
Springer
13 years 12 months ago
How to Preserve the Benefits of Design Patterns
The rapid evolution of Design Patterns has hampered the benefits gained from using Design Patterns. The increase in the number of Design Patterns makes a common vocabulary unmanag...
Ellen Agerbo, Aino Cornils
FOCS
1995
IEEE
13 years 11 months ago
Pseudorandom Generators, Measure Theory, and Natural Proofs
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...
Kenneth W. Regan, D. Sivakumar, Jin-yi Cai
MICCAI
2010
Springer
13 years 6 months ago
Incorporating Priors on Expert Performance Parameters for Segmentation Validation and Label Fusion: A Maximum a Posteriori STAPL
Abstract. In order to evaluate the quality of segmentations of an image and assess intra- and inter-expert variability in segmentation performance, an Expectation Maximization (EM)...
Olivier Commowick, Simon K. Warfield
GIS
2008
ACM
14 years 8 months ago
The multi-rule partial sequenced route query
Trip planning search (TPS) represents an important class of queries in Geographic Information Systems (GIS). In many real-world applications, TPS requests are issued with a number...
Haiquan Chen, Wei-Shinn Ku, Min-Te Sun, Roger Zimm...