From Schneier on Security
Artificial intelligence (AI) has been billed as the next frontier of humanity: the newly available expanse whose exploration
…
B. Schneier| February 29, 2024
The Snows of Maryland are keeping Bill away from this blog again. Here in Chicago we deal with snow (and even earthquakes) in stride--my kids still have yet toaccepted...Lance From Computational Complexity | February 10, 2010 at 02:58 PM
Sam Roweis, an NYU CS professor specializing in machine learning, took his own life last Tuesday night. Jennifer Linden and Maneesh Sahani set up a weblog to share...Lance From Computational Complexity | January 18, 2010 at 12:34 PM
We go all the way back to January for the paper of the year, Mark Braverman's Poly-logarithmic independence fools AC0 circuits. Runners up include the Moser-Tardos...Lance From Computational Complexity | December 28, 2009 at 12:33 PM
With the end of the fall quarter I will take a break from the blog for a few months. This is not another End, just a chance to move my creative juices in another...Lance From Computational Complexity | December 11, 2009 at 11:41 AM
After a talk on derandomization at Midwest Theory Day, someone asked if those techniques could also be used in quantum computing.
In classical randomness under ...Lance From Computational Complexity | December 8, 2009 at 04:05 PM
Quick announcement: If you are a student who wants to go to SODA but doesn't have the funds, click here.
I had forgotten we did this. Here's a video of my daughter...Lance From Computational Complexity | December 7, 2009 at 12:34 PM
Dean Foster asked me for a probability that P=NP. Now P=NP is not a probabilistic event, either P=NP or P?NP (if it's independent it's still equal or unequal in...Lance From Computational Complexity | December 4, 2009 at 12:26 PM
If Professor Alice at Faber College visits Dr. Bob at the University of Southern North Dakota, who should cover Alice's expenses? It depends on who does the asking...Lance From Computational Complexity | December 1, 2009 at 02:39 PM
First a message from David Johnson for proposals on locations for SODA 2012 both in and outside the US.
Here's an interesting approach to the birthday paradox...Lance From Computational Complexity | November 25, 2009 at 11:31 AM
Last Friday DIMACS celebrated its 20th anniversary. Muthu summarizes the event.
DIMACS has served the theoretical computer science community well over these two...Lance From Computational Complexity | November 24, 2009 at 02:04 PM
A student asked me which version of a research paper to cite, a journal (the last reviewed version) or a conference (the first reviewed version) of a paper. I generally...Lance From Computational Complexity | November 20, 2009 at 12:57 PM
As I tweeted yesterday, the videos of talks from the 2009 FOCS conference are now online. Thanks to FOCS PC chair Daniel Spielman and Georgia Tech's ARC Centercollected...Lance From Computational Complexity | November 18, 2009 at 11:43 AM
As a young kid in the Reform Jewish community we used the Union Prayer Book, a traditional book with Hebrew on the right and English on the left with lots of instructions...Lance From Computational Complexity | November 17, 2009 at 01:11 PM
As many university's still feel the effect of the financial crises, many have limited or no positions to hire new tenure-track faculty so I expect the academicUniversity...Lance From Computational Complexity | November 13, 2009 at 11:54 AM
Many of you readers don't remember a time when there were two Germanys or when we didn't think IP = PSPACE. Two walls collapsed in November of 1989 that changed...Lance From Computational Complexity | November 12, 2009 at 11:36 AM
Here is the offer: If you press the button you will receive $200,000. The caveat: Someone you don't know will die.
I was born during run of the original Twilight...Lance From Computational Complexity | November 6, 2009 at 01:29 PM
The new Innovations in Computer Science conference announced their accepted papers earlier this week including my paper with Rahul Santhanam "Bounding Rationality...Lance From Computational Complexity | November 5, 2009 at 12:29 PM
Amir Pnueli, an expert in temporal logic and program verification who won the 1996 Turing Award, passed away Monday from a brain hemorrhage. His colleague Lenore...Lance From Computational Complexity | November 4, 2009 at 11:44 AM
Last month I suggested that students should go to FOCS even if they didn't have a paper there. I doubt my post had much to do with it, but I heard FOCS did attract...Lance From Computational Complexity | October 30, 2009 at 09:35 AM
A girl told her father that history was much easier when he was in school. "Why?" he asked. She responded "Because there was so much less of it."
An old joke, but...Lance From Computational Complexity | October 29, 2009 at 10:41 AM