2127 search results - page 40 / 426 » Computing large matchings fast |
121
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
131
click to vote
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
Automatically discovering common visual patterns from a collection of images is an interesting but yet challenging task, in part because it is computationally prohibiting. Althoug...
137
Voted
ICIP
1994
IEEE
15 years 7 months ago
1994
IEEE
A fast block matching algorithm in the feature domain was proposed by Fok and Au which achieves a computation reduction factor of N/2 with search block size of N
118
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper we present a fast method for computing acoustic likelihoods that makes use of a Graphics Processing Unit (GPU). After enabling the GPU acceleration the main processo...
133
Voted
JILP
2000
15 years 3 months ago
2000
A major challenge of applying profile-based optimization on large real-world applications is how to capture adequate profile information. A large program, especially a GUI-based a...