860 search results - page 128 / 172 » Completeness in two-party secure computation: a computationa... |
148
click to vote
SIGECOM
2010
ACM
15 years 6 months ago
2010
ACM
In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the ...
153
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
192
click to vote
WCNC
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—Cognitive radio networks (CRN) may greatly enhance the throughput based on a given bandwidth. CRN has a unique feature, consisting of uni-directional opportunistic wirel...
171
click to vote
IEEECIT
2010
IEEE
15 years 3 months ago
2010
IEEE
This paper describes a successful integration of the IEEE micromouse competition training programme with regular undergraduate courses at Zhejiang University City College (ZUCC), H...
179
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
Surface registration is a fundamental step in the reconstruction of three-dimensional objects. While there are several fast and reliable methods to align two surfaces, the tools a...