Sciweavers

1068 search results - page 207 / 214
» On Space Bounded Server Algorithms
Sort
View
WADS
2007
Springer
128views Algorithms» more  WADS 2007»
14 years 1 months ago
Approximate Range Searching: The Absolute Model
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
Guilherme Dias da Fonseca
DASFAA
2005
IEEE
157views Database» more  DASFAA 2005»
14 years 1 months ago
Adaptively Detecting Aggregation Bursts in Data Streams
Finding bursts in data streams is attracting much attention in research community due to its broad applications. Existing burst detection methods suffer the problems that 1) the p...
Aoying Zhou, Shouke Qin, Weining Qian
RT
2004
Springer
14 years 27 days 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...
TACAS
2004
Springer
122views Algorithms» more  TACAS 2004»
14 years 27 days ago
A Scalable Incomplete Test for the Boundedness of UML RT Models
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
Stefan Leue, Richard Mayr, Wei Wei
ICALP
2003
Springer
14 years 23 days ago
Anycasting in Adversarial Systems: Routing and Admission Control
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
Baruch Awerbuch, André Brinkmann, Christian...