Sciweavers

5153 search results - page 441 / 1031
» Introduction to Randomized Algorithms
Sort
View
161
Voted
ESANN
2006
15 years 7 months ago
Using sampling methods to improve binding site predictions
Currently the best algorithms for transcription factor binding site prediction are severely limited in accuracy. In previous work we combine random selection under-sampling with th...
Yi Sun, Mark Robinson, Rod Adams, Rene te Boekhors...
AAAI
1997
15 years 7 months ago
Summarizing CSP Hardness with Continuous Probability Distributions
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
Daniel Frost, Irina Rish, Lluís Vila
169
Voted
CORR
2010
Springer
86views Education» more  CORR 2010»
15 years 6 months ago
Matching with Couples Revisited
It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a ge...
Itai Ashlagi, Mark Braverman, Avinatan Hassidim
CVPR
2012
IEEE
13 years 8 months ago
Top-down visual saliency via joint CRF and dictionary learning
Top-down visual saliency facilities object localization by providing a discriminative representation of target objects and a probability map for reducing the search space. In this...
Jimei Yang, Ming-Hsuan Yang
211
Voted
CVPR
2012
IEEE
13 years 8 months ago
A codebook-free and annotation-free approach for fine-grained image categorization
Fine-grained categorization refers to the task of classifying objects that belong to the same basic-level class (e.g. different bird species) and share similar shape or visual app...
Bangpeng Yao, Gary R. Bradski, Fei-Fei Li