Sciweavers

2168 search results - page 63 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
DAGSTUHL
2003
15 years 4 months ago
Cell projection of meshes with non-planar faces
: We review the cell projection method of volume rendering, discussing back-to-front cell sorting, and approximations involved in hardware color computation and interpolation. We d...
Nelson L. Max, Peter L. Williams, Cláudio T...
163
Voted
FOCS
2006
IEEE
15 years 9 months ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
FOCS
1999
IEEE
15 years 7 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk
INFOCOM
2003
IEEE
15 years 8 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
15 years 3 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...