AAAI
2012
11 years 6 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
AAAI
2012
11 years 6 months ago
2012
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
INFOCOM
2012
IEEE
11 years 6 months ago
2012
IEEE
—It is well known that Online Social Networks (OSNs) are vulnerable to privacy leakages, whereby specific information about a user (political affiliation, sexual orientation, g...
ARC
2012
Springer
12 years 1 days ago
2012
Springer
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
ATAL
2011
Springer
12 years 4 months ago
2011
Springer
Recent applications of game theory in security domains use algorithms to solve a Stackelberg model, in which one player (the leader) first commits to a mixed strategy and then th...
SIAMMAX
2011
12 years 7 months ago
2011
Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating thes...
INFOCOM
2011
IEEE
12 years 7 months ago
2011
IEEE
—Localizability of network or node is an important subproblem in sensor localization. While rigidity theory plays an important role in identifying several localizability conditio...
CISS
2010
IEEE
12 years 8 months ago
2010
IEEE
—Gaussian belief propagation is an iterative algorithm for computing the mean of a multivariate Gaussian distribution. Equivalently, the min-sum algorithm can be used to compute ...
ACSAC
2010
IEEE
12 years 8 months ago
2010
IEEE
In this work we show that once a single peer-to-peer (P2P) bot is detected in a network, it may be possible to efficiently identify other members of the same botnet in the same ne...
INFOCOM
2011
IEEE
12 years 8 months ago
2011
IEEE
— Opportunistic routing is proposed to improve the performance of wireless networks by exploiting the broadcast nature and spatial diversity of the wireless medium. In this paper...