3267 search results - page 341 / 654 » Generalized quasirandom graphs |
164
click to vote
EJC
2000
15 years 6 months ago
2000
We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by ...
190
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hype...
208
click to vote
SOFTVIS
2010
ACM
15 years 5 months ago
2010
ACM
Reverse engineering methods produce different descriptions of software architectures. In this work we analyze and define the task of exploring and comparing these descriptions. ...
163
click to vote
NAACL
2010
15 years 4 months ago
2010
Recently, relaxation approaches have been successfully used for MAP inference on NLP problems. In this work we show how to extend the relaxation approach to marginal inference use...
190
click to vote
SOCIALCOM
2010
15 years 4 months ago
2010
The huge size of online social networks (OSNs) makes it prohibitively expensive to precisely measure any properties which require the knowledge of the entire graph. To estimate the...