777 search results - page 108 / 156 » A fast algorithm for the computation of an upper bound on th... |
ICCV
2005
IEEE
14 years 2 months ago
2005
IEEE
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...
TCS
2010
13 years 7 months ago
2010
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
MFCS
2001
Springer
14 years 1 months ago
2001
Springer
Abstract Marek Chrobak1 , Lawrence L. Larmore2 , and Wojciech Rytter3,4 1 Department of Computer Science, University of California Riverside, CA 92521 2 Department of Computer Scie...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
ECML
1998
Springer
14 years 27 days ago
1998
Springer
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...