7930 search results - page 95 / 1586 » Greedy in Approximation Algorithms |
179
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
132
click to vote
TSP
2008
15 years 6 months ago
2008
A new noncooperative eigencoding algorithm is introduced for MIMO Ad hoc networks. The algorithm performs generalized waterfilling with respect to its transmit covariance matrix a...
157
click to vote
GRAPHICSINTERFACE
2000
15 years 7 months ago
2000
A method is presented that can render glossy reflections with arbitrary isotropic bidirectional reflectance distribution functions (BRDFs) at interactive rates using texture mappi...
142
click to vote
ECCC
2007
15 years 6 months ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
143
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...