1670 search results - page 76 / 334 » Fast Computation of Data Correlation Using BDDs |
116
Voted
CORR
2010
Springer
15 years 1 days ago
2010
Springer
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
109
Voted
ACCV
2006
Springer
15 years 8 months ago
2006
Springer
We propose a considerably faster approximation of the well known SIFT method. The main idea is to use efficient data structures for both, the detector and the descriptor. The detec...
123
Voted
IWNAS
2006
IEEE
15 years 8 months ago
2006
IEEE
RDMA reduces network latency by eliminating unnecessary copies from network interface cards to application buffers, but how to reduce memory registration cost is a challenge. Prev...
125
Voted
CSDA
2006
15 years 2 months ago
2006
A framework of penalized generalized linear models and tensor products of B-splines with roughness penalties allows effective smoothing of data in multidimensional arrays. A strai...
138
Voted
GLVLSI
2000
IEEE
15 years 7 months ago
2000
IEEE
In this paper we present a novel and fast estimation technique that produces tight latency lower bounds for Data Flow Graphs representing time critical segments of the application...