Sciweavers

62 search results - page 11 / 13
» A New Approach and Faster Exact Methods for the Maximum Comm...
Sort
View
ATAL
2007
Springer
14 years 2 months ago
Model-based function approximation in reinforcement learning
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
Nicholas K. Jong, Peter Stone
CHI
2008
ACM
14 years 9 months ago
Targeting across displayless space
Multi-monitor displays and multi-display environments are now common. Cross-display cursor movement, in which a user moves the pointer from one display to another, occurs frequent...
Miguel A. Nacenta, Regan L. Mandryk, Carl Gutwin
DAGSTUHL
2003
13 years 10 months ago
Reliable Distance and Intersection Computation Using Finite Precision Geometry
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
Katja Bühler, Eva Dyllong, Wolfram Luther
RECOMB
2008
Springer
14 years 8 months ago
Accurate Computation of Likelihoods in the Coalescent with Recombination Via Parsimony
Understanding the variation of recombination rates across a given genome is crucial for disease gene mapping and for detecting signatures of selection, to name just a couple of app...
Jotun Hein, Rune B. Lyngsø, Yun S. Song
TKDE
2008
153views more  TKDE 2008»
13 years 8 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang