3136 search results - page 176 / 628 » Comparison of Clique-Listing Algorithms |
143
click to vote
COLING
2010
15 years 1 months ago
2010
Sentiment analysis systems can benefit from the translation of sentiment information. We present a novel, graph-based approach using SimRank, a well-established graph-theoretic al...
135
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract—Fast multiplication can be achieved by using canonical signed digit (CSD) to speed-up computations. Conversion to CSD is needed when the multiplier is not known a priori...
183
click to vote
JMLR
2012
13 years 8 months ago
2012
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
146
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
A generalization of the heapsort algorithm is proposed. At the expense of about 50% more comparison and move operations for typical cases, the dualheap sort algorithm offers sever...
141
click to vote
RSA
2006
15 years 6 months ago
2006
Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a ra...