Sciweavers

9842 search results - page 433 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
COMPGEOM
2005
ACM
15 years 6 months ago
Stability of persistence diagrams
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the p...
David Cohen-Steiner, Herbert Edelsbrunner, John Ha...
CSL
2008
Springer
15 years 6 months ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona
AGI
2008
15 years 6 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov
DAGSTUHL
2004
15 years 6 months ago
Learning with Local Models
Next to prediction accuracy, the interpretability of models is one of the fundamental criteria for machine learning algorithms. While high accuracy learners have intensively been e...
Stefan Rüping
CSC
2006
15 years 6 months ago
Parallel Load Balancing Heuristics for Radiative Heat Transfer Calculations
The computation of radiative effects by the Photon Monte Carlo method is computationally demanding, especially when complex, nongray absorption models are employed. To solve such c...
Kamal Viswanath, Ivana Veljkovic, Paul E. Plassman...