August 2005 Archives
2005-08-30 22:27:52
I hope
On the ACM SIGACT webpage, TCS(theoretical computer science) is defined as
following:
That might be useless for solving problems.
The tomorrow lecture, the last one, focus on the algorithms, NP-complete, NP-hard, approximation....etc.
I don't attend the lecture yet, but I guess that the theoretical subgroup of our lab tends to algorithm design and not "theoretical" as I meant.
FRAXIS, my classmate in NTHU, is a ambitious person. He has taken most graduate-level course at college. He seems to have ambition to cover all subfields of CS. He seems that love computer science very much.
I am another type, I chose to be a graduate student because I want to learn how to do research. I like computer science, but not love it.
It might be strange, howerver, I want to be a graduate student because I think I will not be a computer engineer in the future. More precisely, I don't want to be a computer engineer in Taiwan. I might be a salesman or else, so I hope that there is a cheerful period in my life that I can enjoy the fun of research.
The field of theoretical computer science is interpreted broadly so as to include algorithms, data structures, complexity theory, distributed computation, parallel computation, VLSI, machine learning, computational biology, computational geometry, information theory, cryptography, quantum computation, computational number theory and algebra, program semantics and verification, automata theory, and the study of randomness.
I think that some subfields of TCS which is defined above are not so "theoretical", in my opinion, the theoretical not only means that it is not easy to implement and need a lots of deep mathematics, it also means study of its philosophy and essentiality.That might be useless for solving problems.
The tomorrow lecture, the last one, focus on the algorithms, NP-complete, NP-hard, approximation....etc.
I don't attend the lecture yet, but I guess that the theoretical subgroup of our lab tends to algorithm design and not "theoretical" as I meant.
FRAXIS, my classmate in NTHU, is a ambitious person. He has taken most graduate-level course at college. He seems to have ambition to cover all subfields of CS. He seems that love computer science very much.
I am another type, I chose to be a graduate student because I want to learn how to do research. I like computer science, but not love it.
It might be strange, howerver, I want to be a graduate student because I think I will not be a computer engineer in the future. More precisely, I don't want to be a computer engineer in Taiwan. I might be a salesman or else, so I hope that there is a cheerful period in my life that I can enjoy the fun of research.
2005-08-27 00:26:00
Expander Graph
-
The Info. on
Wikipedia.
Course 67659:
Expander graphs and their applications
CS
2414: Expander graphs and their Applications Fall 2003
CS369E:
Expanders in Computer Science - Spring 2005
Introduction
to expander graphs by Michael A. Nielsen. It's a series of introducing
artilcles about Expander Graph. This URL links to a pdf file.
One of lecture notes of CS 591 A1: Algorithms
for the New Age. This
one is about Expander graph.