41 search results - page 7 / 9 » Exact Algorithms for Circles on the Sphere |
206
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
170
Voted
ISMAR
2003
IEEE
15 years 11 months ago
2003
IEEE
Augmented Reality has now progressed to the point where real-time applications are being considered and needed. At the same time it is important that synthetic elements are render...
148
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Optimal constellation design is important in military digital communications for Quadrature Amplitude Modulation (QAM). Optimization realizes a reduced probability of bit error (P...
158
Voted
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
134
Voted
SIGGRAPH
1995
ACM
15 years 9 months ago
1995
ACM
We present new techniques for computing illumination from non-diffuse luminaires and scattering from non-diffuse surfaces. The methods are based on new closed-form expressions d...