1629 search results - page 154 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
UAI
2001
14 years 11 months ago
2001
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
112
Voted
JMLR
2010
14 years 5 months ago
2010
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...
123
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Abstract--Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often ...
84
Voted
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
108
Voted
EDBT
2012
ACM
13 years 20 days ago
2012
ACM
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...