Sciweavers

656 search results - page 66 / 132
» Minimal non-convex words
Sort
View
EOR
2006
110views more  EOR 2006»
14 years 9 months ago
A constructive algorithm for realizing a distance matrix
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...
Sacha C. Varone
COR
2007
99views more  COR 2007»
14 years 9 months ago
An improved algorithm for the p-center problem on interval graphs with unit lengths
The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...
T. C. Edwin Cheng, Liying Kang, C. T. Ng
INFORMATICALT
2006
154views more  INFORMATICALT 2006»
14 years 9 months ago
Efficient Adaptive Algorithms for Transposing Small and Large Matrices on Symmetric Multiprocessors
Matrix transpose in parallel systems typically involves costly all-to-all communications. In this paper, we provide a comparative characterization of various efficient algorithms f...
Rami Al Na'mneh, W. David Pan, Seong-Moo Yoo
CSDA
2007
142views more  CSDA 2007»
14 years 9 months ago
DIVCLUS-T: A monothetic divisive hierarchical clustering method
DIVCLUS-T is a divisive hierarchical clustering algorithm based on a monothetic bipartitional approach allowing the dendrogram of the hierarchy to be read as a decision tree. It i...
Marie Chavent, Yves Lechevallier, Olivier Briant
DAM
2007
74views more  DAM 2007»
14 years 9 months ago
On the uniform edge-partition of a tree
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao ...