12194 search results - page 2067 / 2439 » Numberings Optimal for Learning |
158
click to vote
SOFSEM
2007
Springer
16 years 29 days ago
2007
Springer
We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply structured compared to its competitors. The presented algori...
190
click to vote
WABI
2007
Springer
16 years 28 days 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...
166
Voted
WADS
2007
Springer
16 years 28 days ago
2007
Springer
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
202
click to vote
WADS
2007
Springer
16 years 28 days ago
2007
Springer
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
199
click to vote
WG
2007
Springer
16 years 28 days ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...