Forgot your password?
typodupeerror

Comment: Re:Why would I want low quality video? (Score 1) 152

by smprather (#47558743) Attached to: What percentage of your media consumption is streamed?
I read the poll narrowly as "streamed from an internet source", and for me, that would (potentially) be sourced by 98% Netflix, 2% Amazon. The point I was trying to make is that AV quality matters much more to me than convenience. I'd rather wait for the BluRay disk in the mail, than to stream.

Comment: AIX @ IBM (Score 1) 204

by smprather (#47272731) Attached to: X Window System Turns 30 Years Old
I was a co-op at IBM in Manassas, VA in 1992. My group was aggregating components for a submarine-based rack system with an embedded "monstrous" 19" monitor. I thought running processes on a remote system and viewing the result on a local system was the coolest thing I had ever seen in my life. My mentor was tasked with finding every security leak he could in X. I was clueless then and my brain on overdrive just learning vi (not vim) and ksh. It was a mostly worthless internship, but it did imbue my soul with unix. So I have that going for me.

Comment: Re:What are we doing to our children? (Score 1) 217

by smprather (#44257409) Attached to: Iris Scans Are the New School IDs

Yes, because "we" demand zero-defect terrorism policies.

The people are demanding that. The politicians are claiming that the people are demanding that. The distinction isnt subtle.

Citation? The same could be requested of me. Has anyone even asked this question. Google doesn't turn up much on the topic amazing.

Comment: Algorithms instead of languages? (Score 1) 183

by smprather (#42825289) Attached to: Summer Programming Courses Before Heading Off To College?
https://www.coursera.org/course/algo About the Course In this course you will learn several fundamental principles of algorithm design. You'll learn the divide-and-conquer design paradigm, with applications to fast sorting, searching, and multiplication. You'll learn several blazingly fast primitives for computing on graphs, such as how to compute connectivity information and shortest paths. Finally, we'll study how allowing the computer to "flip coins" can lead to elegant and practical algorithms and data structures. Learn the answers to questions such as: How do data structures like heaps, hash tables, bloom filters, and balanced search trees actually work, anyway? How come QuickSort runs so fast? What can graph algorithms tell us about the structure of the Web and social networks? Did my 3rd-grade teacher explain only a suboptimal algorithm for multiplying two numbers?

Overload -- core meltdown sequence initiated.

Working...