Fastest Algorithm? - 未名空间MITBBS历史存档

国际科技财经博客移民网络热点娱乐民生时事公众号

Redian新闻

>未名空间

>CS - 计算机科学

Fastest Algorithm?

Fastest Algorithm?# CS - 计算机科学

m*k2008-04-05 07:04

1 楼

IT民工，有US CS Master's degree,去年12月打了广告，律师准备以eb3递上去,不爽
，和头谈了一下能否用eb2，他们通了电话，拖到今天被告知还得递eb3, 更不爽，想跳
槽,能否这边申请着，同时找别的工作,跳槽需要还给公司labour certificate filing
fee 吗?
以前好像听说公司不能从员工处要回这笔钱，不知道属实否。谢谢大家！

j*32008-04-05 07:04

2 楼

Couple beginner questions:
(1) What is the run time for computing the principal components of data? Is
there faster than O(n^3) algorithms?
(2) What if I only need one of the principal components (say, the largest)?
I remember seeing somewhere that SVD takes O(n^3). If you happen to know
some references, that would be great.
I appreciate your help. Thank you very much.

r*l2008-04-05 07:04

3 楼

这笔钱必须公司出. 我觉的这个和员工跳槽没有关系.

e*e2008-04-05 07:04

4 楼

"Using the Nystrom Method to Speed Up Kernel Machines" Williams and Seeger

Is

【在 j********3 的大作中提到】

: Couple beginner questions:
: (1) What is the run time for computing the principal components of data? Is
: there faster than O(n^3) algorithms?
: (2) What if I only need one of the principal components (say, the largest)?
: I remember seeing somewhere that SVD takes O(n^3). If you happen to know
: some references, that would be great.
: I appreciate your help. Thank you very much.

j*32008-04-05 07:04

5 楼

etude: Thank you very much for the link. I will have to study it for a
while since I'm not familiar with the area. In the paper, they mentioned:
"There are methods to compute the first p eigenvalues and eigenvectors of K,
but their average running times are significantly below O(n^3) only if p<But they didn't give any references to these methods... I'm interested in p=
1, do you (or anyone) know what these "methods" are?