1376 search results - page 74 / 276 » Searching Trees: An Essay |
126
click to vote
WSS
2001
15 years 1 months ago
2001
Abstract. A data structure is stabilizing if, for any arbitrary (and possibly illegitimate) initial state, any sequence of sufficiently many operations brings the data structure to...
108
click to vote
GECCO
2008
Springer
15 years 29 days ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The associated computational complexity often poses significant challenges for practical r...
100
click to vote
ICIP
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper introduces a new visual representation of a document or group of documents, a Dynamic Document Icon, or Dydocon. Its representation is symbolic like an icon, but change...
TCBB
2008
14 years 11 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...