2127 search results - page 326 / 426 » Computing large matchings fast |
180
click to vote
IFIPPACT
1994
15 years 7 months ago
1994
: We describe an approach to parallel compilation that seeks to harness the vast amount of ne-grain parallelism that is exposed through partial evaluation of numerically-intensive ...
214
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
While numerous algorithms have been proposed for object tracking with demonstrated success, it remains a challenging problem for a tracker to handle large change in scale, motion,...
185
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
We present a novel approach to simultaneously reconstruct the 3D structure of a non-rigid coronary tree and estimate point correspondences between an input X-ray image and a refer...
177
click to vote
ICDCS
2011
IEEE
14 years 6 months ago
2011
IEEE
—Massively parallel scientific applications, running on extreme-scale supercomputers, produce hundreds of terabytes of data per run, driving the need for storage solutions to im...
200
click to vote
BALT
2006
15 years 10 months ago
2006
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...