Sciweavers

3415 search results - page 652 / 683
» Lower Bounds for Kernelizations
Sort
View
RT
2004
Springer
14 years 3 months ago
Real-time appearance preserving out-of-core rendering with shadows
Despite recent advances in finding efficient LOD-representations for gigantic 3D objects, rendering of complex, gigabyte-sized models and environments is still a challenging tas...
Michael Guthe, Pavel Borodin, Ákos Bal&aacu...
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
14 years 3 months ago
Matching Polyhedral Terrains Using Overlays of Envelopes
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
Vladlen Koltun, Carola Wenk
ICPP
2003
IEEE
14 years 3 months ago
Quorum-Based Asynchronous Power-Saving Protocols for IEEE 802.11 Ad Hoc Networks
This paper investigates the power mode management problem for an IEEE 802.11-based mobile ad hoc network (MANET) that allows mobile hosts to tune to the power-saving (PS) mode. The...
Jehn-Ruey Jiang, Yu-Chee Tseng, Chih-Shun Hsu, Ten...
INFOCOM
2003
IEEE
14 years 3 months ago
Internet Quarantine: Requirements for Containing Self-Propagating Code
— It has been clear since 1988 that self-propagating code can quickly spread across a network by exploiting homogeneous security vulnerabilities. However, the last few years have...
David Moore, Colleen Shannon, Geoffrey M. Voelker,...
ISCC
2003
IEEE
14 years 3 months ago
Fair Noiseless Broadcast Source Coding
We present a noiseless source coding problem in a broadcast environment and supply a simple solution to this problem. A transmitter wishes to transmit a binary random vector Ò ½...
Serdar Boztas