787 search results - page 131 / 158 » Polynomial Constants are Decidable |
170
click to vote
VISUALIZATION
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper presents a novel method for computing simulated x-ray images, or DRRs (digitally reconstructed radiographs), of tetrahedral meshes with higher-order attenuation functio...
162
click to vote
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
151
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
153
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
202
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...