1951 search results - page 313 / 391 » An algorithm for improving graph partitions |
137
click to vote
AAAI
2011
14 years 4 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
159
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
177
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
252
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
181
click to vote
SDM
2011
SIAM
14 years 7 months ago
2011
SIAM
This paper describes one of the first attempts to model the temporal structure of massive data streams in real-time using data stream clustering. Recently, many data stream clust...