587 search results - page 37 / 118 » On the Relative Sizes of Learnable Sets |
167
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
Using a set of model landscapes we examine how different mutation rates affect different search metrics. We show that very universal heuristics, such as 1/N and the error threshol...
131
click to vote
JSYML
2006
15 years 5 months ago
2006
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
154
click to vote
JGT
2007
15 years 5 months ago
2007
: Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...
190
click to vote
WWW
2011
ACM
15 years 16 days ago
2011
ACM
The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, ...
142
click to vote
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
In patch-based object recognition, there are two important issues on the codebook generation: (1) resolution: a coarse codebook lacks sufficient discriminative power, and an over-...