16404 search results - page 238 / 3281 » A set coverage problem |
153
click to vote
HIS
2008
15 years 5 months ago
2008
In this paper, we highlight the use of synthetic data sets to analyze learners behavior under bounded complexity. We propose a method to generate synthetic data sets with a specif...
120
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
100
click to vote
CPC
2008
15 years 4 months ago
2008
A set of integers A is called a B2[g] set if every integer m has at most g representations of the form m = a + a , with a a and a, a A. We obtain a new lower bound for F(g, n), t...
140
click to vote
DAM
2006
15 years 4 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
PAMI
1998
15 years 3 months ago
1998
—A novel nonsequential indexing mechanism (termed phonetic set indexing) has been evaluated for the purpose of fast word pre-selection. Our approach to handling the lexical acces...