2127 search results - page 110 / 426 » Computing large matchings fast |
152
click to vote
HIPC
2009
Springer
15 years 1 months ago
2009
Springer
Large scale compute clusters continue to grow to ever-increasing proportions. However, as clusters and applications continue to grow, the Mean Time Between Failures (MTBF) has redu...
169
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
We present a new algorithm for a robust family of Earth Mover’s Distances - EMDs with thresholded ground distances. The algorithm transforms the flow-network of the EMD so that t...
125
click to vote
CLA
2004
15 years 5 months ago
2004
An important problem in applications of formal concept analysis is a possibly large number of clusters extracted from data. Factorization is one of the methods being used to cope w...
115
click to vote
IJON
2000
15 years 3 months ago
2000
The complexity of neural networks of the brain makes studying these networks through computer simulation challenging. Conventional methods, where one models thousands of individua...
137
click to vote
CCP
2011
14 years 3 months ago
2011
This project will involve analysing some of the newer fast algorithms in comparison with an exhaustive full search algorithm for motion estimation in video encoders. It will invest...