1127 search results - page 110 / 226 » Testing the Expansion of a Graph |
119
click to vote
COMGEO
2012
ACM
13 years 5 months ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
WWW
2009
ACM
15 years 10 months ago
2009
ACM
In order to artificially boost the rank of commercial pages in search engine results, search engine optimizers pay for links to these pages on other websites. Identifying paid lin...
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
ICDM
2002
IEEE
15 years 2 months ago
2002
IEEE
Document clustering techniques mostly rely on single term analysis of the document data set, such as the Vector Space Model. To better capture the structure of documents, the unde...