Sciweavers

420 search results - page 83 / 84
» Discovering Conditional Functional Dependencies
Sort
View
CORR
2008
Springer
121views Education» more  CORR 2008»
13 years 5 months ago
Rate-Distortion via Markov Chain Monte Carlo
We propose an approach to lossy source coding, utilizing ideas from Gibbs sampling, simulated annealing, and Markov Chain Monte Carlo (MCMC). The idea is to sample a reconstructio...
Shirin Jalali, Tsachy Weissman
AI
2006
Springer
13 years 5 months ago
Is real-valued minimax pathological?
Deeper searches in game-playing programs relying on the minimax principle generally produce better results. Theoretical analyses, however, suggest that in many cases minimaxing am...
Mitja Lustrek, Matjaz Gams, Ivan Bratko
AMC
2006
67views more  AMC 2006»
13 years 5 months ago
A general probabilistic model of the PCR process
Earlier work by Saha et al. rigorously derived a general probabilistic model for the PCR process that includes as a special case the Velikanov-Kapral model where all nucleotide re...
Nilanjan Saha, Layne T. Watson, Karen Kafadar, Ale...
BMCBI
2004
106views more  BMCBI 2004»
13 years 5 months ago
Spotting effect in microarray experiments
Background: Microarray data must be normalized because they suffer from multiple biases. We have identified a source of spatial experimental variability that significantly affects...
Tristan Mary-Huard, Jean-Jacques Daudin, Sté...
IS
2010
13 years 4 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley