Sciweavers

2721 search results - page 224 / 545
» An experimental analysis of Lemke-Howson algorithm
Sort
View
EUROPAR
2004
Springer
15 years 9 months ago
Efficient Parallel Hierarchical Clustering
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...
Manoranjan Dash, Simona Petrutiu, Peter Scheuerman...
WOB
2003
140views Bioinformatics» more  WOB 2003»
15 years 7 months ago
Computing Maximum Subsequence in Parallel
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
Carlos E. R. Alves, Edson Cáceres, Siang W....

Publication
535views
17 years 5 months ago
Continuous Evaluation of Monochromatic and Bichromatic Reverse Nearest Neighbors
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general as it...
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, ...
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
16 years 3 days ago
Approximating Betweenness Centrality
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...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
WWW
2005
ACM
16 years 6 months ago
Identifying link farm spam pages
With the increasing importance of search in guiding today's web traffic, more and more effort has been spent to create search engine spam. Since link analysis is one of the m...
Baoning Wu, Brian D. Davison