73 search results - page 14 / 15 » Mining for Tree-Query Associations in a Graph |
190
click to vote
CIKM
2005
Springer
16 years 8 days ago
2005
Springer
Despite the recent advances in search quality, the fast increase in the size of the Web collection has introduced new challenges for Web ranking algorithms. In fact, there are sti...
189
Voted
WSDM
2009
ACM
16 years 1 months ago
2009
ACM
A lot of the world’s knowledge is stored in books, which, as a result of recent mass-digitisation efforts, are increasingly available online. Search engines, such as Google Book...
212
Voted
WAW
2004
Springer
16 years 2 days ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
172
Voted
ICFCA
2005
Springer
16 years 7 days ago
2005
Springer
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...
172
Voted
VLDB
2004
ACM
16 years 2 days ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...