Sciweavers

3556 search results - page 286 / 712
» Can machine learning be secure
Sort
View
ICML
2006
IEEE
16 years 6 months ago
Learning to impersonate
Consider Alice, who is interacting with Bob. Alice and Bob have some shared secret which helps Alice identify Bob-impersonators. Now consider Eve, who knows Alice and Bob, but doe...
Moni Naor, Guy N. Rothblum
WWW
2011
ACM
15 years 13 days ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
TCC
2010
Springer
169views Cryptology» more  TCC 2010»
16 years 2 months ago
On Complete Primitives for Fairness
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostr...
ACL
2003
15 years 6 months ago
Coreference Resolution Using Competition Learning Approach
In this paper we propose a competition learning approach to coreference resolution. Traditionally, supervised machine learning approaches adopt the singlecandidate model. Neverthe...
Xiaofeng Yang, Guodong Zhou, Jian Su, Chew Lim Tan
IS
2008
15 years 5 months ago
Mining relational data from text: From strictly supervised to weakly supervised learning
This paper approaches the relation classification problem in information extraction framework with different machine learning strategies, from strictly supervised to weakly superv...
Zhu Zhang