5115 search results - page 647 / 1023 » On Randomized Lanczos Algorithms |
156
click to vote
STOC
2000
ACM
15 years 11 months ago
2000
ACM
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
156
click to vote
KDD
1998
ACM
15 years 11 months ago
1998
ACM
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
172
click to vote
PODC
1990
ACM
15 years 10 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
160
click to vote
ANCS
2007
ACM
15 years 10 months ago
2007
ACM
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
187
Voted
ICA
2007
Springer
15 years 10 months ago
2007
Springer
Independent Component Analysis (ICA) is a statistical method for expressing an observed set of random vectors as a linear combination of statistically independent components. This...