5115 search results - page 412 / 1023 » On Randomized Lanczos Algorithms |
186
click to vote
FOCS
2008
IEEE
16 years 2 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
188
click to vote
ICDM
2008
IEEE
16 years 2 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
202
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
High performance computing is critical for financial markets where analysts seek to accelerate complex optimizations such as pricing engines to maintain a competitive edge. In th...
192
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
222
click to vote
PAKDD
2007
ACM
16 years 1 months ago
2007
ACM
In this paper, we study the privacy-preserving decision tree building problem on vertically partitioned data. We made two contributions. First, we propose a novel hybrid approach, ...