Sciweavers

2095 search results - page 261 / 419
» Improved pebbling bounds
Sort
View
IJCGA
2002
73views more  IJCGA 2002»
15 years 6 months ago
A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
Alexander Wolff, Michael Thon, Yin-Feng Xu
CGF
1999
81views more  CGF 1999»
15 years 6 months ago
Multi-layered impostors for accelerated rendering
This paper describes the successful combination of pre-generated and dynamically updated image-based representations to accelerate the visualization of complex virtual environment...
Xavier Décoret, François X. Sillion,...
SIAMCOMP
1998
176views more  SIAMCOMP 1998»
15 years 6 months ago
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
Yonatan Aumann, Yuval Rabani
NA
2007
81views more  NA 2007»
15 years 6 months ago
Positive weight quadrature on the sphere and monotonicities of Jacobi polynomials
In 2000, Reimer proved that a positive weight quadrature rule on the unit sphere Sd ⊂ Rd+1 has the property of quadrature regularity. Hesse and Sloan used a related property, ca...
Paul C. Leopardi
ECCC
2010
93views more  ECCC 2010»
15 years 5 months ago
Towards Coding for Maximum Errors in Interactive Communication
We show that it is possible to encode any communication protocol between two parties so that the protocol succeeds even if a (1/4 − ǫ) fraction of all symbols transmitted by th...
Mark Braverman, Anup Rao