1578 search results - page 196 / 316 » Direct Routing: Algorithms and Complexity |
112
Voted
CORR
2010
Springer
15 years 2 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...
177
Voted
CVIU
2011
14 years 6 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...
87
Voted
CGF
2008
15 years 2 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 ...
140
Voted
CORR
2008
Springer
15 years 2 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...
117
Voted
STOC
2009
ACM
16 years 3 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...