882 search results - page 159 / 177 » On the Hardness of Graph Isomorphism |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MOBIHOC
2009
ACM
14 years 9 months ago
2009
ACM
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
In this work, we address the problem of joint modeling of text and citations in the topic modeling framework. We present two different models called the Pairwise-Link-LDA and the ...