236 search results - page 18 / 48 » Binary Partitions Revisited |
110
click to vote
DAGSTUHL
2006
15 years 2 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
92
Voted
ICALP
2009
Springer
16 years 28 days ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
100
Voted
CORR
2007
Springer
15 years 19 days ago
2007
Springer
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
113
Voted
EATCS
1998
15 years 10 days ago
1998
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...
101
Voted
SIBGRAPI
2006
IEEE
15 years 6 months ago
2006
IEEE
This work introduces a new compression scheme for point sets. This scheme relies on an adaptive binary space partition (BSP) which takes into account the geometric structure of the...