123 search results - page 13 / 25 » Graph Orientation Algorithms to Minimize the Maximum Outdegr... |
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
IPPS
1996
IEEE
15 years 1 months ago
1996
IEEE
A new VLSI architecture for real-time pipeline FFT processor is proposed. A hardware oriented radix-22 algorithm is derived by integrating a twiddle factor decomposition technique ...
FCCM
2000
IEEE
15 years 1 months ago
2000
IEEE
Simplifying the programming models is paramount to the success of reconfigurable computing. We apply the principles of object-oriented programming to the design of stream archite...
154
click to vote
BIRTHDAY
2011
Springer
13 years 9 months ago
2011
Springer
Abstract. Risk analysis has been used to manage the security of systems for several decades. However, its use has been limited to offline risk computation and manual response. In c...
67
Voted
APPROX
2004
Springer
15 years 2 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...