Sciweavers

2814 search results - page 150 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
124
Voted
AIMSA
2008
Springer
15 years 9 months ago
Incorporating Learning in Grid-Based Randomized SAT Solving
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
113
Voted
PRL
2008
118views more  PRL 2008»
15 years 2 months ago
Bayes Machines for binary classification
In this work we propose an approach to binary classification based on an extension of Bayes Point Machines. Particularly, we take into account the whole set of hypotheses that are...
Daniel Hernández-Lobato, José Miguel...
136
Voted
ISCAS
2005
IEEE
214views Hardware» more  ISCAS 2005»
15 years 8 months ago
Blind separation of statistically independent signals with mixed sub-Gaussian and super-Gaussian probability distributions
— In the context of Independent Component Analysis (ICA), we propose a simple method for online estimation of activation functions in order to blindly separate instantaneous mixt...
Muhammad Tufail, Masahide Abe, Masayuki Kawamata
107
Voted
IJAR
2007
55views more  IJAR 2007»
15 years 2 months ago
Theoretical analysis and practical insights on importance sampling in Bayesian networks
The AIS-BN algorithm [2] is a successful importance sampling-based algorithm for Bayesian networks that relies on two heuristic methods to obtain an initial importance function: -...
Changhe Yuan, Marek J. Druzdzel
123
Voted
IPPS
2000
IEEE
15 years 7 months ago
A Requirements Analysis for Parallel KDD Systems
Abstract. The current generation of data mining tools have limited capacity and performance, since these tools tend to be sequential. This paper explores a migration path out of th...
William Maniatty, Mohammed Javeed Zaki