885 search results - page 158 / 177 » Random Matrices in Data Analysis |
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
DGO
2003
13 years 9 months ago
2003
As part of a National Science Foundation-funded study, we analyze data from a 2002 Midwest urban random sample survey (n = 167 adults) of differential access to and uses of comput...
ESANN
2000
13 years 9 months ago
2000
It has been shown that self-organized maps, when adequately trained with the set of integers 1 to 32, lay out real numbers in a 2D map in an ordering that is superior to any of the...
JCP
2007
13 years 7 months ago
2007
— The ability to mine large volumes of distributed datasets enables more precise decision making. However, privacy concerns should be carefully addressed when mining datasets dis...
ALGORITHMICA
2002
13 years 7 months ago
2002
The implementation of an algorithm is faced with the issues efficiency, flexibility, and ease-of-use. In this paper, we suggest a design concept that greatly increases the flexibi...