5638 search results - page 933 / 1128 » On presence |
171
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
183
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
196
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
In this paper, we present a Gaussian mixture model based approach to capture the spatial characteristics of any target signal in a sensor network, and further propose a temporally...
188
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
A large fraction of the URLs on the web contain duplicate (or near-duplicate) content. De-duping URLs is an extremely important problem for search engines, since all the principal...
180
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...