Sciweavers

1578 search results - page 245 / 316
» Algorithmic randomness of continuous functions
Sort
View
INFORMATICALT
2002
91views more  INFORMATICALT 2002»
13 years 8 months ago
Bayesian Heuristic Approach to Scheduling
Abstract. Real life scheduling problems are solved by heuristics with parameters defined by experts, as usual. In this paper a new approach is proposed where the parameters of vari...
Jonas Mockus
MP
2011
13 years 3 months ago
Null space conditions and thresholds for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
UAI
1997
13 years 10 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
IPPS
2006
IEEE
14 years 2 months ago
Chedar: peer-to-peer middleware
In this paper we present a new peer-to-peer (P2P) middleware called CHEap Distributed ARchitecture (Chedar). Chedar is totally decentralized and can be used as a basis for P2P app...
Annemari Auvinen, Mikko Vapa, Matthieu Weber, Niko...
ECML
2003
Springer
14 years 2 months ago
Logistic Model Trees
Abstract. Tree induction methods and linear models are popular techniques for supervised learning tasks, both for the prediction of nominal classes and continuous numeric values. F...
Niels Landwehr, Mark Hall, Eibe Frank