4542 search results - page 588 / 909 » Design patterns for data structures |
155
Voted
ESA
2004
Springer
16 years 1 days ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
147
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
— Pipelined ASIC architectures are increasingly being used in forwarding engines for high speed IP routers. We explore optimization issues in the design of memory-efficient data...
178
click to vote
MEMOCODE
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
167
click to vote
SBACPAD
2003
IEEE
15 years 12 months ago
2003
IEEE
Collective communication is very useful for parallel applications, especially those in which matrix and vector data structures need to be manipulated by a group of processes. This...
146
click to vote
IEEEMSP
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract— This paper discusses encryption operations that selectively encrypt content-carrying segments of multimedia data stream. We propose and analyze three techniques that wo...