Sciweavers

8413 search results - page 420 / 1683
» Ordering Problem Subgoals
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Fast Gaussian process methods for point process intensity estimation
Point processes are difficult to analyze because they provide only a sparse and noisy observation of the intensity function driving the process. Gaussian Processes offer an attrac...
John P. Cunningham, Krishna V. Shenoy, Maneesh Sah...
RECOMB
2006
Springer
16 years 7 months ago
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
Abstract. During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chrom...
Martin Bader, Enno Ohlebusch
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
16 years 7 months ago
On the composition of authenticated byzantine agreement
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin

Publication
334views
16 years 3 months ago
Rollout Sampling Approximate Policy Iteration
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schem...
Christos Dimitrakakis, Michail G. Lagoudakis
ICASSP
2009
IEEE
16 years 1 months ago
Multiterminal source coding of Bernoulli-Gaussian correlated sources
This paper presents a practical coding scheme for the direct symmetric multiterminal source coding problem with remote source, when the noise between the remote source and the obs...
Francesca Bassi, Michel Kieffer, Çagatay Di...