1469 search results - page 164 / 294 » Approximate polynomial decomposition |
186
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
184
click to vote
SAGT
2009
Springer
15 years 10 months ago
2009
Springer
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
191
click to vote
COMGEO
2006
ACM
15 years 6 months ago
2006
ACM
The ray shooting problem arises in many different contexts and is a bottleneck of ray tracing in computer graphics. Unfortunately, theoretical solutions to the problem are not ver...
180
click to vote
COMGEO
2006
ACM
15 years 6 months ago
2006
ACM
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applica...
229
click to vote
SDM
2012
SIAM
13 years 8 months ago
2012
SIAM
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...