4377 search results - page 664 / 876 » Mass problems and randomness |
196
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
It is now widely recognized that user interactions with search results can provide substantial relevance information on the documents displayed in the search results. In this pape...
167
click to vote
ACSC
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
181
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
218
click to vote
ICPPW
2007
IEEE
16 years 27 days ago
2007
IEEE
We study the role of task-level scheduling in power management on multicore multiple voltage embedded systems. Multicore on-achip, in particular DSP systems, can greatly improve p...
187
click to vote
CRYPTO
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...