757 search results - page 25 / 152 » On the hardness of approximating Max-Satisfy |
CSMR
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract--In contrast to conventional multi-page Web applications, an Ajax application is developed as a single-page application in which content and structure are changed at runti...
SOFSEM
2007
Springer
15 years 3 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
66
Voted
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
TCC
2007
Springer
15 years 3 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
108
click to vote
ECCC
2010
14 years 9 months ago
2010
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...