1578 search results - page 196 / 316 » Direct Routing: Algorithms and Complexity |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
CVIU
2011
13 years 1 months ago
2011
Abstract—In this paper, three approaches to utilizing objectlevel spatial contextual information for semantic image analysis are presented and comparatively evaluated. Contextual...
CGF
2008
13 years 10 months ago
2008
This paper presents a new, scalable, single pass algorithm for computing subsurface scattering using the diffusion approximation. Instead of pre-computing a globally conservative ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...