Sciweavers

323 search results - page 16 / 65
» Verify Your Runs
Sort
View
EUROCRYPT
1995
Springer
15 years 3 months ago
Quantum Oblivious Mutual Identification
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
Claude Crépeau, Louis Salvail
ACE
2004
186views Education» more  ACE 2004»
15 years 1 months ago
TinkerNet: A Low-Cost Networking Laboratory
The 2002 SIGCOMM Workshop on Educational Challenges for Computer Networking [Kur02a] exposed many issues related to teaching computer networking with the need for a laboratory in ...
Michael Erlinger, Mart Molle, Titus Winters, Chris...
INTERNET
2007
113views more  INTERNET 2007»
14 years 11 months ago
REST Eye for the SOA Guy
it’s hardly Earth-shattering: abstracting your business services and separating them from your applications can yield an overall system that’s easier to build, maintain, and ex...
Steve Vinoski
IASTEDSEA
2004
15 years 1 months ago
Java bytecode verification with dynamic structures
Java applets run on a Virtual Machine that checks code's integrity and correctness before execution using a module called Bytecode Verifier. Java Card technology allows Java ...
Cinzia Bernardeschi, Luca Martini, Paolo Masci
STOC
1996
ACM
197views Algorithms» more  STOC 1996»
15 years 3 months ago
Computing Betti Numbers via Combinatorial Laplacians
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
Joel Friedman