Sciweavers

303 search results - page 50 / 61
» Computing Minimal Spanning Subgraphs in Linear Time
Sort
View
COMPGEOM
2006
ACM
14 years 1 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
PODC
2009
ACM
14 years 8 months ago
Tight bounds for clock synchronization
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer
CGF
2008
150views more  CGF 2008»
13 years 7 months ago
Compact, Fast and Robust Grids for Ray Tracing
The focus of research in acceleration structures for ray tracing recently shifted from render time to time to image, the sum of build time and render time, and also the memory foo...
Ares Lagae, Philip Dutré
SIAMJO
2010
155views more  SIAMJO 2010»
13 years 2 months ago
Optimal Portfolio Execution Strategies and Sensitivity to Price Impact Parameters
When liquidating a portfolio of large blocks of risky assets, an institutional investor wants to minimize the cost as well as the risk of execution. An optimal execution strategy ...
Somayeh Moazeni, Thomas F. Coleman, Yuying Li
SIBGRAPI
2007
IEEE
14 years 1 months ago
Improved Reversible Mapping from Color to Gray
— In the reversible conversion of color images to gray ones, colors are mapped to textures and from the textures the receiver can recover the colors, i.e. one may print a color i...
Ricardo L. de Queiroz