Sciweavers

2434 search results - page 399 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
AAAI
2011
14 years 3 months ago
Quantity Makes Quality: Learning with Partial Views
In many real world applications, the number of examples to learn from is plentiful, but we can only obtain limited information on each individual example. We study the possibiliti...
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, O...
CVPR
2012
IEEE
13 years 5 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
132
Voted
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 9 months ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
110
Voted
BMCBI
2008
139views more  BMCBI 2008»
15 years 3 months ago
Abbreviation definition identification based on automatic precision estimates
Background: The rapid growth of biomedical literature presents challenges for automatic text processing, and one of the challenges is abbreviation identification. The presence of ...
Sunghwan Sohn, Donald C. Comeau, Won Kim, W. John ...
124
Voted
COMPGEOM
2009
ACM
15 years 9 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...