13603 search results - page 413 / 2721 » On the Complexity of Computing Treelength |
233
click to vote
FCCM
2006
IEEE
15 years 11 months ago
2006
IEEE
With advances in reconfigurable hardware, especially field-programmable gate arrays (FPGAs), it has become possible to use reconfigurable hardware to accelerate complex applicatio...
218
click to vote
CCGRID
2001
IEEE
15 years 11 months ago
2001
IEEE
Resource management is an important infrastructure in the grid computing environment. Scalability and adaptability are two key challenges in the implementation of such complex sof...
219
click to vote
COCOON
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
168
click to vote
ALENEX
2004
15 years 9 months ago
2004
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
195
click to vote
CGVR
2006
15 years 9 months ago
2006
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...