492 search results - page 63 / 99 » Fast data stream algorithms using associative memories |
VISUALIZATION
2005
IEEE
14 years 1 months ago
2005
IEEE
Recent years have seen an immense increase in the complexity of geometric data sets. Today’s gigabyte-sized polygon models can no longer be completely loaded into the main memor...
CASES
2003
ACM
14 years 28 days ago
2003
ACM
This paper presents a highly predictable, low overhead and yet dynamic, memory allocation strategy for embedded systems with scratch-pad memory. A scratch-pad is a fast compiler-m...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
ICNP
2007
IEEE
14 years 2 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
SIGMOD
1999
ACM
13 years 12 months ago
1999
ACM
In recent years, many data mining methods have been proposed for finding useful and structured information from market basket data. The association rule model was recently propos...