2485 search results - page 270 / 497 » Time Bounded Frequency Computations |
RTCSA
2003
IEEE
14 years 1 months ago
2003
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
GD
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
Suffix trees and suffix arrays are the most prominent full-text indices, and their construction algorithms are well studied. In the literature, the fastest algorithm runs in O(n...
CNIS
2006
13 years 9 months ago
2006
Multidimensional Packet Classification is one of the most critical functions for network security devices such as firewalls and intrusion detection systems. Due to the worst case ...