727 search results - page 41 / 146 » Private approximation of search problems |
128
Voted
HIPC
2007
Springer
15 years 4 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
113
Voted
EACL
2009
ACL Anthology
16 years 1 months ago
2009
ACL Anthology
We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise...
96
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
This paper presents a search algorithm for finding functions that are highly correlated with an arbitrary set of data. The functions found by the search can be used to approximate...
102
Voted
NIPS
2004
15 years 2 months ago
2004
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
95
Voted
ECCC
2007
15 years 17 days ago
2007
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...