319 search results - page 11 / 64 » Cryptographic Assumptions: A Position Paper |
ECML
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We study the problem of learning from positive and unlabeled examples. Although several techniques exist for dealing with this problem, they all assume that positive exam...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
MVA
2007
14 years 11 months ago
2007
This paper presents uncertainty propagation in landmark based position estimation methods. Analysis of two methods has been carried out where robot position is estimated by detect...
137
click to vote
ACNS
2011
Springer
14 years 1 months ago
2011
Springer
The increasing use of computing devices for social interactions propels the proliferation of online social applications, yet, it prompts a number of privacy concerns. One common p...
105
click to vote
KDD
2008
ACM
15 years 10 months ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...