201 search results - page 21 / 41 » The Minimum Substring Cover Problem |
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
109
click to vote
CPM
2005
Springer
15 years 1 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
JPDC
2008
14 years 11 months ago
2008
Let P be a polygonal region which is forbidden for placing a base station in the context of mobile communication. Our objective is to place one base station at any point on the bo...
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— Energy-efficient broadcast communication is an important problem in wireless ad hoc networks. Previously, minimum-energy broadcast that exploits the broadcast nature of radio ...
AAAI
2008
15 years 2 months ago
2008
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...