4377 search results - page 640 / 876 » Mass problems and randomness |
188
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
188
click to vote
PIMRC
2010
IEEE
15 years 4 months ago
2010
IEEE
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...
170
click to vote
QEST
2010
IEEE
15 years 4 months ago
2010
IEEE
Information hiding is a general concept which refers to the goal of preventing an adversary to infer secret information from the observables. Anonymity and Information Flow are exa...
165
click to vote
CISC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Direct anonymous attestation (DAA) is a special digital signature primitive, which provides a balance between signer authentication and privacy. One of the most interesti...
204
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...