Sciweavers

3333 search results - page 218 / 667
» Abstract Proof Search
Sort
View
TCOM
2010
112views more  TCOM 2010»
15 years 2 months ago
On further reduction of complexity in tree pruning based sphere search
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
Byonghyo Shim, Insung Kang
ICDE
2010
IEEE
174views Database» more  ICDE 2010»
15 years 2 months ago
Semantic flooding: Search over semantic links
Abstract-- Classification hierarchies are trees where links codify the fact that a node lower in the hierarchy contains documents whose contents are more specific than those one le...
Fausto Giunchiglia, Uladzimir Kharkevich, Alethia ...
GC
2004
Springer
15 years 9 months ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 9 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
TAPSOFT
1997
Springer
15 years 8 months ago
An Applicative Module Calculus
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
Judicaël Courant