Sciweavers

1820 search results - page 335 / 364
» Hierarchical Clustering of Words
Sort
View
JPDC
2007
138views more  JPDC 2007»
14 years 11 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
JWSR
2007
114views more  JWSR 2007»
14 years 11 months ago
Development of Distance Measures for Process Mining, Discovery and Integration
: Business processes continue to play an important role in today’s service-oriented enterprise computing systems. Mining, discovering, and integrating process-oriented services h...
Joonsoo Bae, Ling Liu, James Caverlee, Liang-Jie Z...
IPL
1998
119views more  IPL 1998»
14 years 10 months ago
A 2.5-Factor Approximation Algorithm for the k-MST Problem
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Sunil Arya, H. Ramesh
MP
1998
117views more  MP 1998»
14 years 10 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
72
Voted
SIGIR
2002
ACM
14 years 10 months ago
Improving stemming for Arabic information retrieval: light stemming and co-occurrence analysis
Arabic, a highly inflected language, requires good stemming for effective information retrieval, yet no standard approach to stemming has emerged. We developed several light stemm...
Leah S. Larkey, Lisa Ballesteros, Margaret E. Conn...