4114 search results - page 524 / 823 » Efficient Algorithms for the 2-Center Problems |
165
click to vote
TON
2008
15 years 6 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
192
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
192
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
210
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: There is an increasing demand to assemble and align large-scale biological sequence data sets. The commonly used multiple sequence alignment programs are still limited...
195
click to vote
PVLDB
2010
15 years 1 months ago
2010
Top-k queries are widely applied for retrieving a ranked set of the k most interesting objects based on the individual user preferences. As an example, in online marketplaces, cus...