Sciweavers

11428 search results - page 2137 / 2286
» Learning From Crowds
Sort
View
201
Voted
SIAMCOMP
2011
15 years 1 months ago
Black-Box Constructions of Protocols for Secure Computation
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yeh...
202
Voted
JMLR
2010
116views more  JMLR 2010»
15 years 28 days ago
Feature Selection, Association Rules Network and Theory Building
As the size and dimensionality of data sets increase, the task of feature selection has become increasingly important. In this paper we demonstrate how association rules can be us...
Sanjay Chawla
JOC
2010
123views more  JOC 2010»
15 years 28 days ago
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Abstract. In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computati...
Yonatan Aumann, Yehuda Lindell
217
Voted
PVLDB
2010
116views more  PVLDB 2010»
15 years 27 days ago
Schism: a Workload-Driven Approach to Database Replication and Partitioning
We present Schism, a novel workload-aware approach for database partitioning and replication designed to improve scalability of sharednothing distributed databases. Because distri...
Carlo Curino, Yang Zhang, Evan P. C. Jones, Samuel...
209
Voted
TIP
2010
255views more  TIP 2010»
15 years 26 days ago
Image Super-Resolution Via Sparse Representation
This paper presents a new approach to single-image superresolution, based on sparse signal representation. Research on image statistics suggests that image patches can be wellrepre...
Jianchao Yang, John Wright, Thomas S. Huang, Yi Ma
« Prev « First page 2137 / 2286 Last » Next »