13603 search results - page 2386 / 2721 » On the Complexity of Computing Treelength |
152
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
216
click to vote
VMV
2001
15 years 8 months ago
2001
The handling of situations where multiple visual information occurs requires the fusion of visual information. This is a very common task found in the processing of multisource / ...
204
click to vote
VMV
2001
15 years 8 months ago
2001
Adaptive mesh refinement (AMR) is a numerical simulation technique used in computational fluid dynamics (CFD). By using a set of nested grids of different resolutions, AMR combine...
185
click to vote
UAI
2004
15 years 8 months ago
2004
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...
213
click to vote
ISCAPDCS
2003
15 years 8 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...