13603 search results - page 192 / 2721 » On the Complexity of Computing Treelength |
145
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
157
click to vote
HPCC
2007
Springer
15 years 10 months ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
138
click to vote
IWCMC
2006
ACM
15 years 10 months ago
2006
ACM
Space time convolutional codes (STCCs) are an effective way to combine transmit diversity with coding. The computational complexity of designing STCCs generally increases exponent...
162
click to vote
SIGGRAPH
1996
ACM
15 years 8 months ago
1996
ACM
We present a new method that utilizes path coherence to accelerate walkthroughs of geometrically complex static scenes. As a preprocessing step, our method constructs a BSP-tree t...
158
click to vote
FCT
2007
Springer
15 years 6 months ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...