727 search results - page 14 / 146 » Private approximation of search problems |
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
SODA
2000
ACM
14 years 10 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
CSC
2006
14 years 11 months ago
2006
Abstract: Tikhonov regularization is a popular and effective method for the approximate solution of illposed problems, including Fredholm equations of the first kind. The Tikhonov ...
CALC
2001
Springer
15 years 1 months ago
2001
Springer
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...