14078 search results - page 320 / 2816 » Design and Analysis of Computer Algorithms |
183
click to vote
TCSV
2008
15 years 6 months ago
2008
Conventional subspace learning or recent feature extraction methods consider globality as the key criterion to design discriminative algorithms for image classification. We demonst...
182
click to vote
TKDE
2002
15 years 6 months ago
2002
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
153
Voted
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
158
click to vote
ICNC
2005
Springer
16 years 6 days ago
2005
Springer
The problem of automatic classification of ultrasound images is addressed. For texture analysis of ultrasound images quantifiable indexes, called features, are used. Classificat...
179
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...