12825 search results - page 2274 / 2565 » Improved PLSOM algorithm |
129
click to vote
DAM
2008
15 years 4 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
138
click to vote
ADHOC
2006
15 years 4 months ago
2006
ct 9 It is often useful to know the positions of nodes in a network. However, in a large network it is impractical to build a 10 single global map. In this paper, we present a new ...
144
click to vote
ENTCS
2008
15 years 4 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
124
click to vote
ENTCS
2008
15 years 4 months ago
2008
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
135
click to vote
CGF
2006
15 years 4 months ago
2006
We present the Optimizing Control Variate (OCV) estimator, a new estimator for Monte Carlo rendering. Based upon a deterministic sampling framework, OCV allows multiple importance...