224 search results - page 35 / 45 » G-graphs for the cage problem: a new upper bound |
152
click to vote
SI3D
2006
ACM
16 years 18 hour ago
2006
ACM
Shadow maps are a widely used shadowing technique in real time graphics. One major drawback of their use is that they cannot be filtered in the same way as color textures, typica...
180
click to vote
ISLPED
1996
ACM
15 years 10 months ago
1996
ACM
In this paper, we present a new statistical technique for estimation of average power dissipation in digital circuits. Present statistical techniques estimate the average power ba...
153
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
153
click to vote
ISSAC
2009
Springer
16 years 19 days ago
2009
Springer
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
174
click to vote
STACS
2007
Springer
16 years 5 days ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...