2542 search results - page 259 / 509 » Computing Cartograms with Optimal Complexity |
135
Voted
CVPR
2005
IEEE
16 years 2 months ago
2005
IEEE
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
122
click to vote
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Joint data alignment is often regarded as a data simplification process. This idea is powerful and general, but raises two delicate issues. First, one must make sure that the usef...
122
Voted
HPCA
2000
IEEE
15 years 5 months ago
2000
IEEE
Efficiency of synchronization mechanisms can limit the parallel performance of many shared-memory applications. In addition, the ever increasing performance gap between processor...
129
Voted
ICDCS
1999
IEEE
15 years 4 months ago
1999
IEEE
There is growing interest in run-time detection as parallel and distributed systems grow larger and more complex. This work targets run-time analysis of complex, interactive scien...
112
click to vote
CPM
2004
Springer
15 years 4 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...