Search found 8 matches
- Wed Jan 17, 2007 10:27 pm
- Forum: Algorithms
- Topic: Calculating T-largest eigenvalues
- Replies: 1
- Views: 1940
Calculating T-largest eigenvalues
Hi, i need an algorithm to find T-largest eigen values and the coresponding eigen vector.. After searching for a while on the web, it seems QR Algorithm is a popular methods, but it seems to look for ALL the eigen values.. is there any better (faster) way to find not all but only T-largest eigen ...
- Sat Jan 13, 2007 5:58 pm
- Forum: C++
- Topic: 100% CPU Usage...
- Replies: 3
- Views: 2507
- Wed Jan 10, 2007 11:23 am
- Forum: C++
- Topic: 100% CPU Usage...
- Replies: 3
- Views: 2507
100% CPU Usage...
hi all.. i was developing a new software for my college project.. it was acting as a middletier between application and database for safety reason... the software works fine but when i look at task manager->performance, when my software ran, cpu time will rise up to 100%...
here's a little look at ...
here's a little look at ...
- Mon Oct 16, 2006 6:37 pm
- Forum: Algorithms
- Topic: 2D Rabin Karp
- Replies: 0
- Views: 2347
2D Rabin Karp
problem:
suppose that there is a M*N matrix, and there is a m*n matrix where m <= M && N <= n, compute the number of occurance of the small matrix in the big one...
i'm thinking to use rabin karp algorithm to solve this problem, but i kinda confuse on how to efficiently compute the hash value.
In ...
suppose that there is a M*N matrix, and there is a m*n matrix where m <= M && N <= n, compute the number of occurance of the small matrix in the big one...
i'm thinking to use rabin karp algorithm to solve this problem, but i kinda confuse on how to efficiently compute the hash value.
In ...
- Mon Oct 16, 2006 6:10 pm
- Forum: Algorithms
- Topic: How To Compute Shortest Distance Between Two Lines
- Replies: 5
- Views: 3347
- Fri Oct 13, 2006 4:23 am
- Forum: Algorithms
- Topic: How To Compute Shortest Distance Between Two Lines
- Replies: 5
- Views: 3347
How To Compute Shortest Distance Between Two Lines
problems:
given A=(x1,y1),B=(x2,y2),C=(x3,y3),D=(x4,y4)....
how to compute shortest distance between line AB to line CD...
if the lines intersect than distance = 0, if the lines not intersect, there would be a lot of possibillities, and that mean a lot of if else if else if...
is there some ...
given A=(x1,y1),B=(x2,y2),C=(x3,y3),D=(x4,y4)....
how to compute shortest distance between line AB to line CD...
if the lines intersect than distance = 0, if the lines not intersect, there would be a lot of possibillities, and that mean a lot of if else if else if...
is there some ...
- Fri Jul 21, 2006 8:28 am
- Forum: Volume 100 (10000-10099)
- Topic: 10044 - Erdos Numbers
- Replies: 102
- Views: 55231
i use vector<string> for the authors data, stl queue for BFS buffer and adjacency matrix for the graph implementation, what would be the size of the matrix? is 1000*1000 enough??? i think the size should be maxauthor*maxauthor, but how much is the maximum number of author??
i got a RTE so i tought ...
i got a RTE so i tought ...
- Fri Jul 14, 2006 11:38 am
- Forum: Volume 100 (10000-10099)
- Topic: 10044 - Erdos Numbers
- Replies: 102
- Views: 55231