Sciweavers

631 search results - page 27 / 127
» Additive Approximation for Edge-Deletion Problems
Sort
View
ECRTS
2004
IEEE
14 years 1 months ago
An Event Stream Driven Approximation for the Analysis of Real-Time Systems
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
Karsten Albers, Frank Slomka
SI3D
2006
ACM
14 years 4 months ago
Approximate ambient occlusion for trees
Natural scenes contain large amounts of geometry, such as hundreds of thousands or even millions of tree leaves and grass blades. Subtle lighting effects present in such environme...
Kyle Hegeman, Simon Premoze, Michael Ashikhmin, Ge...
ACL
2006
13 years 11 months ago
Topic-Focused Multi-Document Summarization Using an Approximate Oracle Score
We consider the problem of producing a multi-document summary given a collection of documents. Since most successful methods of multi-document summarization are still largely extr...
John M. Conroy, Judith D. Schlesinger, Dianne P. O...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 4 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
FOCS
2008
IEEE
14 years 4 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder