3136 search results - page 102 / 628 » Comparison of Clique-Listing Algorithms |
162
click to vote
JNW
2006
15 years 6 months ago
2006
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
162
click to vote
NIPS
2004
15 years 7 months ago
2004
The Bradley-Terry model for paired comparison has been popular in many areas. We propose a generalized version in which paired individual comparisons are extended to paired team c...
140
click to vote
COCOON
2009
Springer
16 years 26 days ago
2009
Springer
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
175
click to vote
STOC
2000
ACM
15 years 10 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
178
click to vote
FSS
2008
15 years 6 months ago
2008
The grade of membership (GoM) model uses fuzzy sets as memberships of each individual to extreme profiles (or classes) on the likelihood function of multivariate multinomial distr...