7930 search results - page 1205 / 1586 » Greedy in Approximation Algorithms |
211
click to vote
TOG
2008
15 years 6 months ago
2008
We present a real-time algorithm called compensated ray marching for rendering of smoke under dynamic low-frequency environment lighting. Our approach is based on a decomposition ...
175
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
184
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
178
click to vote
VC
1998
15 years 6 months ago
1998
The vertex representation, a new data structure for representing and manipulating orthogonal objects, is presented. Both interiors and boundaries of regions are represented implic...
185
Voted
MP
2007
15 years 6 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...