2799 search results - page 196 / 560 » Comparing Point Clouds |
181
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
196
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we present the use of a previously developed single-objective optimization approach, together with the -constraint method, to provide an approximation of the Pareto ...
163
click to vote
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
In quantitative verification, system states/transitions have associated costs, and these are used to associate mean-payoff costs with infinite behaviors. In this paper, we propose ...
172
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
159
click to vote
ACRI
2004
Springer
15 years 10 months ago
2004
Springer
We study herewith the simple threshold cellular automata (CA), as perhaps the simplest broad class of CA with non-additive (i.e., non-linear and non-affine) local update rules. We ...