Sciweavers

4850 search results - page 82 / 970
» Approximate Data Structures with Applications
Sort
View
SIGMOD
2005
ACM
162views Database» more  SIGMOD 2005»
15 years 10 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...
JAT
2006
64views more  JAT 2006»
14 years 9 months ago
Nonlinear function approximation: Computing smooth solutions with an adaptive greedy algorithm
Opposed to linear schemes, nonlinear function approximation allows to obtain a dimension independent rate of convergence. Unfortunately, in the presence of data noise typical algo...
Andreas Hofinger
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
15 years 3 months ago
Separating Structure from Interestingness
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
BILDMED
2007
134views Algorithms» more  BILDMED 2007»
14 years 11 months ago
Generation of Hulls Encompassing Neuronal Pathways Based on Tetrahedralization and 3D Alpha Shapes
Abstract. Diffusion tensor imaging provides information about structure and location of white matter tracts within the human brain which is of particular interest for neurosurgery...
Dorit Merhof, Martin Meister, Ezgi Bingöl, Pe...
POPL
1998
ACM
15 years 2 months ago
A Functional Representation of Data Structures with a Hole
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
Yasuhiko Minamide