3105 search results - page 355 / 621 » The Path-Packing Structure of Graphs |
158
Voted
ICDAR
2005
IEEE
15 years 10 months ago
2005
IEEE
The table recognition literature contains many strategies specified informally as a sequence of operations, obscuring both models of table structure and the effects of individual...
146
click to vote
ISCIS
2005
Springer
15 years 10 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
161
click to vote
PAMI
2008
15 years 4 months ago
2008
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity meas...
159
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
157
Voted
CIE
2007
Springer
15 years 10 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....