Sciweavers

545 search results - page 33 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
CORR
2004
Springer
122views Education» more  CORR 2004»
13 years 8 months ago
Simple Distributed Weighted Matchings
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
Jaap-Henk Hoepman
RT
2001
Springer
14 years 28 days ago
Realistic Reflections and Refractions on Graphics Hardware with Hybrid Rendering and Layered Environment Maps
We introduce hybrid rendering, a scheme that dynamically ray traces the local geometry of reflective and refractive objects, but approximates more distant geometry by hardwaresupp...
Ziyad S. Hakura, John M. Snyder
ECIR
2007
Springer
13 years 10 months ago
A Study of Global Inference Algorithms in Multi-document Summarization
Abstract. In this work we study the theoretical and empirical properties of various global inference algorithms for multi-document summarization. We start by defining a general fr...
Ryan T. McDonald
INFOCOM
2006
IEEE
14 years 2 months ago
Adaptive Admission Control Algorithm for Multiuser OFDMA Wireless Networks
—We propose a new adaptive admission control scheme for multiuser OFDMA systems to allocate wireless resource with low complexity. In this adaptive admission control scheme, the ...
Kyung-Ho Sohn, Jongkyung Kim, Tae Sung Kim, Young ...
OA
1989
237views Algorithms» more  OA 1989»
14 years 16 days ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph