gphilip

47 ms·

181.
by gphilip 15y ago
I see. Now I get your comment, thanks. So you read "very low acceptance rates" to mean : "Alas, very few of our papers meet the criteria for publication". And hence the exhortation to produce novel, correct, and significant work if they wan
182.
by gphilip 15y ago
Thanks for that clarification. If I may trouble you once more, I do see a list of the issues of the community in that article, set apart in slanted font. As far as I can see, the issue which you highlighted in your comment here is not prese
183.
by gphilip 15y ago
"Poor, poor CS profs: They can't get their research papers published. " This does not seem to be the OP's complaint, and I am quite surprised that this is what it seemed like to you. I am not a native speaker of English, and so it is quite
184.
by gphilip 15y ago
... And some of us may have a vote. Read below for more information. LIPIcs (Leibniz International Proceedings in Informatics) [1] is a series of high-quality open access (available online and free of charge) conference proceedings in inf
185.
A ballot is on to decide if ICALP proceedings should go open access.(eatcs.org)
2 points by gphilip 15y ago|1 comments
186.
by gphilip 15y ago
Yes
187.
High-school grad rustles up an 8-bit computer from scratch(boingboing.net)
2 points by gphilip 15y ago|0 comments
188.
by gphilip 16y ago
"The better example is, you found out where her long-lost cousin lived, some guy eavesdropped, and HE told her where said cousin lived, and she jumped into HIS arms and drove off into the sunset. You are not now without an object that you f
189.
Mathematicians have a go at monkeys writing Hamlet; hilarity ensues.(math.stackexchange.com)
2 points by gphilip 16y ago|0 comments
190.
Drop a printed map on its land and there will be at least one common point. Why?(mathoverflow.net)
6 points by gphilip 16y ago|0 comments
191.
by gphilip 16y ago
Part of the reason behind the existence of these sites is --- I believe --- the hope that they will be useful to well-motivated people who want to learn some of this stuff themselves. Some of these questions and answers just blow our mind.
192.
Algorithms from the Book(cstheory.stackexchange.com)
84 points by gphilip 16y ago|4 comments
193.
Provably optimal greedy algorithms for NP-hard problems(cstheory.stackexchange.com)
2 points by gphilip 16y ago|0 comments
194.
Why are so many programmers arrogant?(programmers.stackexchange.com)
3 points by gphilip 16y ago|0 comments