Sciweavers

2681 search results - page 60 / 537
» Problem F
Sort
View
JGO
2011
149views more  JGO 2011»
13 years 3 months ago
A logarithmic-quadratic proximal point scalarization method for multiobjective programming
We present a proximal point method to solve multiobjective problems based on the scalarization for maps. We build a family of a convex scalar strict representation of a convex map...
Ronaldo Gregório, Paulo Roberto Oliveira
ASIACRYPT
2007
Springer
14 years 3 months ago
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
Ueli M. Maurer, Dominik Raub
COLT
2005
Springer
14 years 2 months ago
Learnability of Bipartite Ranking Functions
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
Shivani Agarwal, Dan Roth
STOC
1993
ACM
121views Algorithms» more  STOC 1993»
14 years 1 months ago
On the generation of multivariate polynomials which are hard to factor
In this paper we consider the di culty of factoring multivariate polynomials F(x y z :::) modulo n. We consider in particular the case in which F is a product of two randomly chose...
Adi Shamir
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
14 years 9 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour