Sciweavers

2214 search results - page 273 / 443
» Complexity of Reasoning
Sort
View
PODC
2010
ACM
15 years 7 months ago
Verifying linearizability with hindsight
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev,...
107
Voted
WCNC
2010
IEEE
15 years 7 months ago
Scalable Mismatch Compensation for Time-Interleaved A/D Converters in OFDM Reception
Abstract—Realization of all-digital baseband receiver processing for multi-Gigabit communication requires analog-to-digital converters(ADCs) of sufficient rate and output resolu...
Sandeep Ponnuru, Upamanyu Madhow
138
Voted
CRYPTO
2008
Springer
134views Cryptology» more  CRYPTO 2008»
15 years 5 months ago
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
Chris Peikert, Vinod Vaikuntanathan
130
Voted
SSR
2001
83views more  SSR 2001»
15 years 5 months ago
Increasing the confidence in off-the-shelf components: a software connector-based approach
The promise of component-based software development is that larger, more complex systems can be built reasonably quickly and reliably from pre-fabricated ("off-the-shelf"...
Marija Mikic-Rakic, Nenad Medvidovic
136
Voted
IJVR
2008
135views more  IJVR 2008»
15 years 3 months ago
Employing Virtual Lecturers' Facial Expressions in Virtual Educational Environments
This research began with a preliminary exploratory study that observed the relationship between the facial expressions of three human lecturers in a real academic lecture theatre a...
G. Theonas, D. Hobbs, D. Rigas