221 search results - page 34 / 45 » Efficient sampling of random permutations |
ICIP
2003
IEEE
14 years 9 months ago
2003
IEEE
In this paper, we describe a retrieval system that uses hidden annotation to improve the performance. The contribution of this paper is a novel active learning framework that can ...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
JSAT
2008
13 years 7 months ago
2008
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
Abstract. We describe a Markov chain Monte Carlo based particle filter that effectively deals with interacting targets, i.e., targets that are influenced by the proximity and/or be...
BMCBI
2006
13 years 8 months ago
2006
Background: Numerous feature selection methods have been applied to the identification of differentially expressed genes in microarray data. These include simple fold change, clas...