Sciweavers

601 search results - page 7 / 121
» Verifiable Network-Performance Measurements
Sort
View
CRYPTO
2009
Springer
111views Cryptology» more  CRYPTO 2009»
14 years 11 days ago
The Round Complexity of Verifiable Secret Sharing Revisited
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...
Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pand...
ACSAC
2009
IEEE
14 years 14 days ago
Justifying Integrity Using a Virtual Machine Verifier
Emerging distributed computing architectures, such as grid and cloud computing, depend on the high integrity execution of each system in the computation. While integrity measuremen...
Joshua Schiffman, Thomas Moyer, Christopher Shal, ...
JMLR
2010
94views more  JMLR 2010»
13 years 6 months ago
A Rotation Test to Verify Latent Structure
We consider here how to tell whether a latent variable that has been estimated in a multivariate regression context might be real. Often a followup investigation will find a real...
Patrick O. Perry, Art B. Owen
INTERSPEECH
2010
13 years 3 months ago
Verifying pronunciation dictionaries using conflict analysis
We describe a new language-independent technique for automatically identifying errors in an electronic pronunciation dictionary by analyzing the source of conflicting patterns dir...
Marelie H. Davel, Febe de Wet
TRIDENTCOM
2006
IEEE
14 years 2 months ago
A scalable framework for representation and exchange of network measurements
Grid and distributed computing environments are evolving rapidly and driving the development of system and network technologies. The design of applications has placed an increased...
Jason Zurawski, D. Martin Swany, Dan Gunter