Sciweavers

2489 search results - page 24 / 498
» On the Subgroup Distance Problem
Sort
View
CVPR
2010
IEEE
14 years 3 months ago
An automatic unsupervised classification of MR images in Alzheimer's disease
Image-analysis methods play an important role in helping detect brain changes in and diagnosis of Alzheimer's Disease (AD). In this paper, we propose an automatic unsupervised...
Xiaojing Long
ANOR
2006
64views more  ANOR 2006»
13 years 7 months ago
A note on asymptotic formulae for one-dimensional network flow problems
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...
Carlos F. Daganzo, Karen R. Smilowitz
COR
2006
88views more  COR 2006»
13 years 7 months ago
An exact algorithm for the capacitated vertex p-center problem
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
F. Aykut Özsoy, Mustafa Ç. Pinar
TOC
2008
71views more  TOC 2008»
13 years 7 months ago
The One-Way Communication Complexity of Hamming Distance
Abstract: Consider the following version of the Hamming distance problem for
T. S. Jayram, Ravi Kumar, D. Sivakumar
IANDC
2007
117views more  IANDC 2007»
13 years 7 months ago
Computing the edit distance of a regular language
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
Stavros Konstantinidis