Sciweavers

829 search results - page 88 / 166
» Bandit Algorithms for Tree Search
Sort
View
CEC
2008
IEEE
14 years 11 months ago
Directed trees: A powerful representation for sorting and ordering problems
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
Benjamin Doerr, Edda Happ
TSP
2008
140views more  TSP 2008»
14 years 9 months ago
On the Dual-Tree Complex Wavelet Packet and M-Band Transforms
The two-band discrete wavelet transform (DWT) provides an octave-band analysis in the frequency domain, but this might not be "optimal" for a given signal. The discrete w...
I. Bayram, Ivan W. Selesnick
VLDB
2005
ACM
397views Database» more  VLDB 2005»
15 years 10 months ago
Concurrency control and recovery for balanced B-link trees
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
PAMI
2011
14 years 4 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
15 years 10 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...