644 search results - page 76 / 129 » Real Algebraic Numbers: Complexity Analysis and Experimentat... |
150
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
342
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
156
click to vote
BMCBI
2007
15 years 5 months ago
2007
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
177
click to vote
WAW
2007
Springer
15 years 12 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
189
Voted
EUROPAR
2004
Springer
15 years 9 months ago
2004
Springer
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...