148 search results - page 30 / 30 » Linear Time Algorithm for the Longest Common Repeat Problem |
SIGECOM
2003
ACM
14 years 1 months ago
2003
ACM
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
BMCBI
2005
13 years 7 months ago
2005
Abstract. Taxonomy provides one of the most powerful ways to navigate sequence data bases but currently, users are forced to formulate queries according to a single taxonomic class...
SIGMETRICS
2004
ACM
14 years 1 months ago
2004
ACM
Traditional Peer-to-Peer (P2P) networks do not provide service differentiation and incentive for users. Consequently, users can easily access information without contributing any ...