1158 search results - page 203 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
104
click to vote
IIS
2003
15 years 13 days ago
2003
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
STOC
2007
ACM
15 years 11 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
101
click to vote
COCO
2003
Springer
15 years 4 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
STOC
2000
ACM
15 years 3 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
CIAC
2000
Springer
15 years 3 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...