Sciweavers

1368 search results - page 81 / 274
» Avoiding Simplicity Is Complex
Sort
View
FOCS
2005
IEEE
14 years 3 months ago
Towards a Final Analysis of Pairing Heaps
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
Seth Pettie
INFOCOM
2005
IEEE
14 years 3 months ago
On static reachability analysis of IP networks
The primary purpose of a network is to provide reachability between applications running on end hosts. In this paper, we describe how to compute the reachability a network provide...
Geoffrey G. Xie, Jibin Zhan, David A. Maltz, Hui Z...
RTAS
2005
IEEE
14 years 3 months ago
On Schedulability Bounds of Static Priority Schedulers
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
Jianjia Wu, Jyh-Charn Liu, Wei Zhao
APGV
2005
ACM
130views Visualization» more  APGV 2005»
14 years 3 months ago
Exploitation of human shadow perception for fast shadow rendering
In this paper we describe an experiment to obtain information about the perceptual potential of the human visual system regarding shadow perception. Shadows play an important part...
Mirko Sattler, Ralf Sarlette, Thomas Mücken, ...
CANS
2005
Springer
86views Cryptology» more  CANS 2005»
14 years 3 months ago
On the Performance and Analysis of DNS Security Extensions
The Domain Name System (DNS) is an essential component of the critical infrastructure of the Internet. The role of DNS is vital, as it is involved in virtually every Internet tran...
Reza Curtmola, Aniello Del Sorbo, Giuseppe Atenies...