Sciweavers

2745 search results - page 63 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
106
Voted
FSR
2007
Springer
108views Robotics» more  FSR 2007»
15 years 9 months ago
Robust Real-Time Local Laser Scanner Registration with Uncertainty Estimation
We present a fast, robust method for registering successive laser rangefinder scans. Correspondences between the current scan and previous scans are determined. Gaussian uncertai...
Justin Carlson, Charles E. Thorpe, David L. Duke
225
Voted
SIGMOD
2005
ACM
162views Database» more  SIGMOD 2005»
16 years 3 months ago
Fast and Approximate Stream Mining of Quantiles and Frequencies Using Graphics Processors
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
Naga K. Govindaraju, Nikunj Raghuvanshi, Dinesh Ma...
IDA
2011
Springer
14 years 10 months ago
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
Annalisa Appice, Michelangelo Ceci, Antonio Turi, ...
153
Voted
ICDCS
2006
IEEE
15 years 9 months ago
ParRescue: Scalable Parallel Algorithm and Implementation for Biclustering over Large Distributed Datasets
Biclustering refers to simultaneously capturing correlations present among subsets of attributes (columns) and records (rows). It is widely used in data mining applications includ...
Jianhong Zhou, Ashfaq A. Khokhar
133
Voted
ICDE
2012
IEEE
191views Database» more  ICDE 2012»
13 years 5 months ago
Processing and Notifying Range Top-k Subscriptions
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
Albert Yu, Pankaj K. Agarwal, Jun Yang 0001