1536 search results - page 164 / 308 » Approximately Dominating Representatives |
141
click to vote
TSP
2008
15 years 3 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
142
click to vote
CGF
1998
15 years 3 months ago
1998
We introduce a new data structure in the form of a light hierarchy for efficiently ray-tracing scenes with many light sources. An octree is constructed with the point light sourc...
117
click to vote
COMGEO
1999
ACM
15 years 3 months ago
1999
ACM
We present a new approach for simplifying models composed of rational spline patches. Given an input model, the algorithm computes a new approximation of the model in terms of cub...
132
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—We provide a formal model for the Change Management process for Enterprise IT systems, and develop change scheduling algorithms that seek to attain the “change capacit...
136
click to vote
JMLR
2010
14 years 10 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...