37 search results - page 3 / 8 » Further combinatorial constructions for optimal frequency-ho... |
ECCC
2000
13 years 7 months ago
2000
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
JMLR
2012
11 years 9 months ago
2012
In this paper we propose a new approach for semi-supervised structured output learning. Our approach uses relaxed labeling on unlabeled data to deal with the combinatorial nature ...
WABI
2007
Springer
14 years 1 months ago
2007
Springer
The within-species genetic variation due to recombinations leads to a mosaic-like structure of DNA. This structure can be modeled, e.g. by parsing sample sequences of current DNA w...
EUROCAST
2009
Springer
14 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
WOB
2004
13 years 8 months ago
2004
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...