Sciweavers

CORR
2006
Springer
146views Education» more  CORR 2006»
13 years 8 months ago
Oblivious-Transfer Amplification
Abstract. Oblivious transfer (OT) is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately...
Jürg Wullschleger
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 8 months ago
Broadcast Cooperation Strategies for Two Colocated Users
This work considers the problem of communication from a single transmitter, over a network with colocated users, through an independent block Rayleigh fading channel. The colocati...
Avi Steiner, Amichai Sanderovich, Shlomo Shamai
CORR
2006
Springer
103views Education» more  CORR 2006»
13 years 8 months ago
Finite State Channels with Time-Invariant Deterministic Feedback
Haim H. Permuter, Tsachy Weissman, Andrea J. Golds...
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 8 months ago
Wiretap Channel With Side Information
Bin Dai, Yuan Luo
CORR
2006
Springer
127views Education» more  CORR 2006»
13 years 8 months ago
Post-Processing Hierarchical Community Structures: Quality Improvements and Multi-scale View
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...
Pascal Pons
CORR
2006
Springer
105views Education» more  CORR 2006»
13 years 8 months ago
Using Users' Expectations to Adapt Business Intelligence Systems
: This paper takes a look at the general characteristics of business or economic intelligence system. The role of the user within this type of system is emphasized. We propose two ...
Babajide Afolabi, Odile Thiery
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 8 months ago
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
Patrick Baillot, Marco Pedicini
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 8 months ago
Reversal Complexity Revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
André Hernich, Nicole Schweikardt
CORR
2006
Springer
112views Education» more  CORR 2006»
13 years 8 months ago
Satisfying KBO Constraints
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
Harald Zankl, Aart Middeldorp