52 search results - page 8 / 11 » Oblivious Randomized Direct Search for Real-Parameter Optimi... |
IR
2007
13 years 6 months ago
2007
Variants of Huffman codes where words are taken as the source symbols are currently the most attractive choices to compress natural language text databases. In particular, Tagged...
CIKM
2010
Springer
13 years 4 months ago
2010
Springer
Dealing with verbose (or long) queries poses a new challenge for information retrieval. Selecting a subset of the original query (a "sub-query") has been shown to be an ...
IPM
2011
12 years 10 months ago
2011
In recent years, new semistatic word-based byte-oriented text compressors, such as Tagged Huffman and those based on Dense Codes, have shown that it is possible to perform fast d...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
CCCG
2004
13 years 8 months ago
2004
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...