Sciweavers

2131 search results - page 385 / 427
» A computational approximation to the AIXI model
Sort
View
JUCS
2010
152views more  JUCS 2010»
13 years 3 months ago
Compositional Semantics of Dataflow Networks with Query-Driven Communication of Exact Values
: We develop and study the concept of dataflow process networks as used for example by Kahn to suit exact computation over data types related to real numbers, such as continuous fu...
Michal Konecný, Amin Farjudian
ALMOB
2006
80views more  ALMOB 2006»
13 years 8 months ago
Pattern statistics on Markov chains and sensitivity to parameter estimation
Background: In order to compute pattern statistics in computational biology a Markov model is commonly used to take into account the sequence composition. Usually its parameter mu...
Grégory Nuel
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
14 years 1 months ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail
VISUALIZATION
1998
IEEE
14 years 1 months ago
Large scale terrain visualization using the restricted quadtree triangulation
Real-time rendering of triangulated surfaces has attracted growing interest in the last few years. However, interactive visualization of very large scale grid digital elevation mo...
Renato Pajarola
ECML
1993
Springer
14 years 27 days ago
Complexity Dimensions and Learnability
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
Shan-Hwei Nienhuys-Cheng, Mark Polman