Sciweavers

2570 search results - page 137 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
100
Voted
CORR
2006
Springer
98views Education» more  CORR 2006»
15 years 3 months ago
Faster Algorithms for Constructing a Concept (Galois) Lattice
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...
Vicky Choi
ICPR
2006
IEEE
16 years 4 months ago
An LBP-Based Active Contour Algorithm for Unsupervised Texture Segmentation
This paper presents a novel algorithm for unsupervised texture segmentation. The proposed algorithm incorporates the Local Binary Pattern operator under a segmentation framework b...
Dimitrios E. Maroulis, Dimitrios K. Iakovidis, Mic...
121
Voted
GECCO
2009
Springer
131views Optimization» more  GECCO 2009»
15 years 8 months ago
Application of a simple binary genetic algorithm to a noiseless testbed benchmark
One of the earliest evolutionary computation algorithms, the genetic algorithm, is applied to the noise-free BBOB 2009 testbed. It is adapted to the continuous domain by increasin...
Miguel Nicolau
IJCAI
2007
15 years 4 months ago
Kernel Conjugate Gradient for Fast Kernel Machines
We propose a novel variant of the conjugate gradient algorithm, Kernel Conjugate Gradient (KCG), designed to speed up learning for kernel machines with differentiable loss functio...
Nathan D. Ratliff, J. Andrew Bagnell
UAI
2000
15 years 4 months ago
Fast Planning in Stochastic Games
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...
Michael J. Kearns, Yishay Mansour, Satinder P. Sin...