6045 search results - page 910 / 1209 » Computable Linearizations of Well-partial-orderings |
128
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
154
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we introduce XCSF with support vector prediction: the problem of learning the prediction function is solved as a support vector regression problem and each classifie...
186
click to vote
FGR
2006
IEEE
15 years 10 months ago
2006
IEEE
Non-linear subspaces derived using kernel methods have been found to be superior compared to linear subspaces in modeling or classification tasks of several visual phenomena. Such...
160
click to vote
MFCS
1995
Springer
15 years 10 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
179
click to vote
RT
1995
Springer
15 years 10 months ago
1995
Springer
Abstract: The problem of global illumination is virtually synonymouswith solving the rendering equation. Although a great deal of research has been directed toward Monte Carlo and ...