3068 search results - page 319 / 614 » Separation Results on the |
163
click to vote
MCS
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. Obtaining ground truth for hyperspectral data is an expensive task. In addition, a number of factors cause the spectral signatures of the same class to vary with location...
173
click to vote
COLT
2001
Springer
15 years 11 months ago
2001
Springer
A class C of recursive functions is called robustly learnable in the sense I (where I is any success criterion of learning) if not only C itself but even all transformed classes Î...
176
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
192
click to vote
DM
2010
15 years 6 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
176
click to vote
TNN
2008
15 years 6 months ago
2008
In this paper, it is found that the weights of a perceptron are bounded for all initial weights if there exists a nonempty set of initial weights that the weights of the perceptron...