Sciweavers

1218 search results - page 47 / 244
» Scaling up a
Sort
View
DMIN
2008
147views Data Mining» more  DMIN 2008»
13 years 10 months ago
Approximate Computation of Object Distances by Locality-Sensitive Hashing
We propose an approximate computation technique for inter-object distances for binary data sets. Our approach is based on the locality sensitive hashing, scales up with the number ...
Selim Mimaroglu, Dan A. Simovici
NIPS
2007
13 years 10 months ago
Stable Dual Dynamic Programming
Recently, we have introduced a novel approach to dynamic programming and reinforcement learning that is based on maintaining explicit representations of stationary distributions i...
Tao Wang, Daniel J. Lizotte, Michael H. Bowling, D...
MLDM
2009
Springer
14 years 3 months ago
PMCRI: A Parallel Modular Classification Rule Induction Framework
In a world where massive amounts of data are recorded on a large scale we need data mining technologies to gain knowledge from the data in a reasonable time. The Top Down Induction...
Frederic T. Stahl, Max A. Bramer, Mo Adda
ISPASS
2005
IEEE
14 years 2 months ago
On the Scalability of 1- and 2-Dimensional SIMD Extensions for Multimedia Applications
SIMD extensions are the most common technique used in current processors for multimedia computing. In order to obtain more performance for emerging applications SIMD extensions ne...
Friman Sánchez, Mauricio Alvarez, Esther Sa...
CVPR
2011
IEEE
13 years 4 months ago
Multicore Bundle Adjustment
We present the design and implementation of new inexact Newton type Bundle Adjustment algorithms that exploit hardware parallelism for efficiently solving large scale 3D scene re...
Changchang Wu, Sameer Agarwal, Brian Curless, Stev...