315 search results - page 25 / 63 » Algebraic Lower Bounds for Computing on Encrypted Data |
PAKDD
2009
ACM
15 years 5 months ago
2009
ACM
Given a set of rating data for a set of items, determining the values of items is a matter of importance and various probability models have been proposed. The Plackett-Luce model ...
103
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
118
click to vote
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
In this paper, we propose a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). Previous information-theoretic model selection cri...
88
Voted
COCO
2005
Springer
15 years 6 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
104
click to vote
ICLP
2007
Springer
15 years 4 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...