Difference between revisions of "69: Pillow Talk"

Explain xkcd: It's 'cause you're dumb.
Jump to: navigation, search
m (Waldir moved page Pillow Talk to 69: Pillow Talk: Mass-moving pages to 'number: title' format, per discussion at explain xkcd:Community portal/Coordination#Page names)
m (replaced: == Description == → ==Explanation==)
Line 1: Line 1:
 
{{ComicHeader|69|February 27, 2006}}
 
{{ComicHeader|69|February 27, 2006}}
  
[[File:Pillow_talk.jpg]]
+
[[File:Pillow talk.jpg]]
  
 
== Image Text ==
 
== Image Text ==
 
Maybe I should've tried Wexler?
 
Maybe I should've tried Wexler?
  
== Description ==
+
==Explanation==
 
The joke is pretty self-explanatory, so I'll just fill in the backgrounds of [[Cueball]]'s thoughts: The [http://en.wikipedia.org/wiki/Bellman_Ford Bellman-Ford algorithm] is an algorithm that calculates the shortest path(s) through a weighted digraph or collection of connected nodes or vertices. The “Wexler” in the image text refers to Wexler's algorithm, which is used to deal with the inverse problem of [http://en.wikipedia.org/wiki/Electrical_Impedance_Tomography Electrical Impedance Tomography], or simply stated: the electrical conductivity of an (imhomogeneus) object.
 
The joke is pretty self-explanatory, so I'll just fill in the backgrounds of [[Cueball]]'s thoughts: The [http://en.wikipedia.org/wiki/Bellman_Ford Bellman-Ford algorithm] is an algorithm that calculates the shortest path(s) through a weighted digraph or collection of connected nodes or vertices. The “Wexler” in the image text refers to Wexler's algorithm, which is used to deal with the inverse problem of [http://en.wikipedia.org/wiki/Electrical_Impedance_Tomography Electrical Impedance Tomography], or simply stated: the electrical conductivity of an (imhomogeneus) object.
  

Revision as of 00:17, 9 August 2012

Template:ComicHeader

pillow talk.jpg

Image Text

Maybe I should've tried Wexler?

Explanation

The joke is pretty self-explanatory, so I'll just fill in the backgrounds of Cueball's thoughts: The Bellman-Ford algorithm is an algorithm that calculates the shortest path(s) through a weighted digraph or collection of connected nodes or vertices. The “Wexler” in the image text refers to Wexler's algorithm, which is used to deal with the inverse problem of Electrical Impedance Tomography, or simply stated: the electrical conductivity of an (imhomogeneus) object.

And yes, both make terrible pillow talk, according to my significant other.