6279 search results - page 317 / 1256 » Studies in Solution Sampling |
187
click to vote
STOC
2003
ACM
16 years 7 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...
195
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Learning object categories from small samples is a challenging problem, where machine learning tools can in general provide very few guarantees. Exploiting prior knowledge may be ...
162
click to vote
ECBS
2009
IEEE
16 years 1 months ago
2009
IEEE
Sensornet lifespan and utility is limited by the energy resources of individual motes. Network designers seek to maximise energy efficiency while maintaining acceptable Quality o...
158
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— A novel criterion is introduced for assessing the diversity of a collection of paths or trajectories. The main idea is the notion of survivability, which measures the likelihoo...
181
click to vote
WABI
2009
Springer
16 years 1 months ago
2009
Springer
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...