458 search results - page 39 / 92 » Perfect Skolem sets |
ESA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
108
Voted
ESA
2009
Springer
15 years 6 months ago
2009
Springer
A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m − 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ...
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
222
click to vote
ICIAR
2009
Springer
15 years 6 months ago
2009
Springer
The SIFT (Scale Invariant Feature Transform) descriptor is a widely used method for matching image features. However, perfect scale invariance can not be achieved in practice becau...
AINA
2008
IEEE
15 years 6 months ago
2008
IEEE
In content-based communication, information flows towards interested hosts rather than towards specifically set destinations. This new style of communication perfectly fits the...