Sciweavers

1332 search results - page 39 / 267
» An Efficient Algorithm for the Approximate Median Selection ...
Sort
View
RCIS
2010
13 years 6 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
UAI
1998
13 years 9 months ago
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
Ronald Parr
JIFS
2002
107views more  JIFS 2002»
13 years 8 months ago
Model selection via Genetic Algorithms for RBF networks
This work addresses the problem of finding the adjustable parameters of a learning algorithm using Genetic Algorithms. This problem is also known as the model selection problem. In...
Estefane G. M. de Lacerda, André Carlos Pon...
AAAI
1998
13 years 9 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
ECCV
2008
Springer
14 years 10 months ago
Solving Image Registration Problems Using Interior Point Methods
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
Camillo J. Taylor, Arvind Bhusnurmath