2492 search results - page 64 / 499 » On the General Signature Trees |
ICIP
1999
IEEE
14 years 9 months ago
1999
IEEE
W e present a simple and eficient scheme for using the Set Partitioning in Hierarchical Trees (SPIHT) image compression algorithm [l]in a generalized multiple description framewor...
DISOPT
2010
13 years 7 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
CICLING
2010
Springer
13 years 11 months ago
2010
Springer
"Short-text clustering" is a very important research field due to the current tendency for people to use very short documents, e.g. blogs, text-messaging and others. In s...
AAAI
2010
13 years 9 months ago
2010
We develop a method for detecting symmetries in arbitrary games and exploiting these symmetries when using tree search to play the game. Games in the General Game Playing domain a...
DM
2008
13 years 7 months ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...