79 search results - page 12 / 16 » Maximizing Several Cuts Simultaneously |
GRAPHICSINTERFACE
2008
13 years 8 months ago
2008
Shadow maps are commonly used in real-time rendering, but they cannot be filtered linearly like standard color, resulting in severe aliasing. Variance shadow maps resolve this pro...
SODA
2007
ACM
13 years 8 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
CCCG
2006
13 years 8 months ago
2006
Every simple planar polygon can undergo only a finite number of pocket flips before becoming convex. Since Erdos posed this as an open problem in 1935, several independent purport...
GLOBECOM
2010
IEEE
13 years 4 months ago
2010
IEEE
Statistical multiplexing aims at transmitting several variable bit rate (VBR) encoded video streams over a bandlimited channel. Rate-distortion (RD) models for the encoded streams ...
SIAMDM
2010
13 years 1 months ago
2010
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...