13603 search results - page 389 / 2721 » On the Complexity of Computing Treelength |
185
Voted
ICGI
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
200
click to vote
APWEB
2010
Springer
15 years 7 months ago
2010
Springer
SimRank has been proposed to rank web documents based on a graph model on hyperlinks. The existing techniques for conducting SimRank computation adopt an iteration computation para...
209
click to vote
ICIP
2000
IEEE
16 years 9 months ago
2000
IEEE
In this paper, we present a class of algorithms that use a partial distance metric to speedup the motion estimation process. The partial distance metric is used within the motion ...
194
Voted
TCC
2009
Springer
16 years 8 months ago
2009
Springer
Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study...
209
Voted
INTERACTION
2009
ACM
16 years 2 months ago
2009
ACM
In this paper, we introduce a novel binary method for fast computation of an objective function to measure inter and intra class similarities, which is used for combining multiple...