162 search results - page 10 / 33 » Improved Parameterized Algorithms for the Kemeny Aggregation... |
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
ANTSW
2006
Springer
14 years 11 days ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
TON
2008
13 years 8 months ago
2008
An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data ...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...