652 search results - page 43 / 131 » fast 2004 |
IOR
2007
13 years 7 months ago
2007
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
BMCBI
2004
13 years 7 months ago
2004
Background: Parallel computing is frequently used to speed up computationally expensive tasks in Bioinformatics. Results: Herein, a parallel version of the multi-alignment program...
FIMI
2004
13 years 9 months ago
2004
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
CN
2004
13 years 7 months ago
2004
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
WSCG
2004
13 years 9 months ago
2004
Triangle strips have been widely used for static mesh representation because they are optimal for rendering. This primitive reduces the number of vertices sent to the graphics pip...