Sciweavers

4781 search results - page 892 / 957
» Online algorithms for network design
Sort
View
CIKM
2007
Springer
15 years 7 months ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
COMPSAC
1998
IEEE
15 years 5 months ago
Allocating Data Objects to Multiple Sites for Fast Browsing of Hypermedia Documents
Many world wide web applications require access, transfer, and synchronization of large multimedia data objects (MDOs) (such as, audio, video, and images) across the communication...
Siu-Kai So, Ishfaq Ahmad, Kamalakar Karlapalem
SIGCOMM
1998
ACM
15 years 5 months ago
Quality of Service Based Routing: A Performance Perspective
Recent studies provide evidence that Quality ofService QoS routing can provide increased network utilization compared to routing that is not sensitive to QoS requirements of tra...
George Apostolopoulos, Roch Guérin, Sanjay ...
DAC
1996
ACM
15 years 5 months ago
Optimal Clock Skew Scheduling Tolerant to Process Variations
1- A methodology is presented in this paper for determining an optimal set of clock path delays for designing high performance VLSI/ULSI-based clock distribution networks. This met...
José Luis Neves, Eby G. Friedman
FPGA
2004
ACM
163views FPGA» more  FPGA 2004»
15 years 5 months ago
Time and area efficient pattern matching on FPGAs
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
Zachary K. Baker, Viktor K. Prasanna