Sciweavers

700 search results - page 137 / 140
» et 2008
Sort
View
CCS
2008
ACM
13 years 9 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
CIKM
2008
Springer
13 years 9 months ago
Using English information in non-English web search
The leading web search engines have spent a decade building highly specialized ranking functions for English web pages. One of the reasons these ranking functions are effective is...
Wei Gao, John Blitzer, Ming Zhou
ASIACRYPT
2008
Springer
13 years 9 months ago
MPC vs. SFE : Unconditional and Computational Security
Abstract. In secure computation among a set P of players one considers an adversary who can corrupt certain players. The three usually considered types of corruption are active, pa...
Martin Hirt, Ueli M. Maurer, Vassilis Zikas
COCOA
2008
Springer
13 years 9 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
COLT
2008
Springer
13 years 9 months ago
An Information Theoretic Framework for Multi-view Learning
In the multi-view learning paradigm, the input variable is partitioned into two different views X1 and X2 and there is a target variable Y of interest. The underlying assumption i...
Karthik Sridharan, Sham M. Kakade