4894 search results - page 739 / 979 » The Guarding Problem - Complexity and Approximation |
123
Voted
CANS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We consider generic Garbled Circuit (GC)-based techniques for Secure Function Evaluation (SFE) in the semi-honest model. We describe efficient GC constructions for additi...
126
Voted
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but efficient solutions are only known in special cases. One appealing ap...
126
Voted
IDA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We tackle the problem of new users or documents in collaborative filtering. Generalization over users by grouping them into user groups is beneficial when a rating is t...
140
Voted
CEC
2008
IEEE
15 years 9 months ago
2008
IEEE
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
129
Voted
ICPP
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper we consider gossip-based Peer-to-Peer streaming applications where multiple sources exist and they work serially. More specifically, we tackle the problem of fast s...