4110 search results - page 347 / 822 » Efficient algorithms for the 2-gathering problem |
168
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
209
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Two central problems in computational biology are the determination of the alignment and phylogeny of a set of biological sequences. The traditional approach to this p...
188
click to vote
TC
2010
15 years 1 months ago
2010
Continued logarithms, as originally introduced by Gosper, represent a means for exact rational arithmetic, but their application to exact real arithmetic is limited by the uniquene...
179
click to vote
DEXA
2005
Springer
16 years 7 days ago
2005
Springer
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm wa...
192
click to vote
ICWS
2010
IEEE
15 years 8 months ago
2010
IEEE
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...