Sciweavers

169 search results - page 7 / 34
» From Operating-System Correctness to Pervasively Verified Ap...
Sort
View
HIPC
2007
Springer
15 years 3 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
MM
2005
ACM
219views Multimedia» more  MM 2005»
15 years 5 months ago
Pervasive views: area exploration and guidance using extended image media
This work achieves full registration of scenes in a large area and creates visual indexes for visualization in a digital city. We explore effective mapping, indexing, and display ...
Jiang Yu Zheng, Xiaolong Wang
CN
2002
96views more  CN 2002»
14 years 11 months ago
A transparent deployment method of RSVP-aware applications on UNIX
This paper proposes a method, called RLR (RSVP (Resource reSerVation Protocol) library redirection), which can transform legacy Internet applications into RSVP-aware applications ...
Yu-Ben Miao, Wen-Shyang Hwang, Ce-Kuen Shieh
ASPDAC
2008
ACM
106views Hardware» more  ASPDAC 2008»
15 years 22 days ago
Verifying full-custom multipliers by Boolean equivalence checking and an arithmetic bit level proof
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...
Udo Krautz, Markus Wedler, Wolfgang Kunz, Kai Webe...
99
Voted
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 5 days ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...