315 search results - page 23 / 63 » Algebraic Lower Bounds for Computing on Encrypted Data |
96
Voted
PKDD
2010
Springer
14 years 10 months ago
2010
Springer
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
100
Voted
PODS
2003
ACM
16 years 17 days ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
101
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
The past decade has witnessed many interesting algorithms for maintaining statistics over a data stream. This paper initiates a theoretical study of algorithms for monitoring distr...
78
Voted
ALENEX
2007
15 years 1 months ago
2007
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
94
Voted
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...