432 search results - page 50 / 87 » Internally deterministic parallel algorithms can be fast |
124
click to vote
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— A distributed online learning framework for support vector machines (SVMs) is presented and analyzed. First, the generic binary classification problem is decomposed in...
104
Voted
VLDB
2001
ACM
15 years 6 months ago
2001
ACM
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
117
Voted
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
95
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Particle Image Velocimetry (PIV) is a method of imaging and analysing fields of flows. The PIV techniques compute and display all the motion vectors of the field in a resulting im...
140
click to vote
SI3D
2012
ACM
13 years 9 months ago
2012
ACM
Bounding volume hierarchies (BVHs) are a popular acceleration structure choice for animated scenes rendered with ray tracing. This is due to the relative simplicity of refitting ...