332 karma · joined November 11, 2007
https://chrome.google.com/webstore/detail/nlbjncdgjeocebhnmk...
I have no idea why it is not part of the default install though.
For those who are just starting on this subject, I highly recommend that you rework the proofs for the bounds between the various matrix norms [1]. These bounds are the building blocks for most interesting analyses in matrix computations. And understanding these analyses are essential if you want to know which algorithm will work best for your problems.
[1]: http://en.wikipedia.org/wiki/Matrix_norm#Examples_of_norm_eq...
https://chrome.google.com/webstore/detail/jeoacafpbcihiomhla...
Do you realize the hypocrisy of what you are saying? You criticizes that taking things literally is bad by taking Schmidt's comments literally.
-- From Wikipedia, http://en.wikipedia.org/wiki/Konqueror
Also, the slides give little information about scalability of the two models. From what I know, the performance of non-blocking I/O should degrades more gracefully in presence of high concurrency. I would have liked to see some numbers about that.
[1]: http://www.python.org/dev/peps/pep-3146/#performance-retrosp...
import operator
def factorial(n):
return reduce(operator.mul, xrange(1, n+1), 1)
print factorial(6)
Cutting-edge programmer: import math
print(math.factorial(6)) while inotifywait -r -e modify .
do
git wip save "automatic save"
done beewulf() { curl -s -I $1 | grep Server: }So yes, the whole operation is O(1) on average.
def __delitem__(self, key):
'od.__delitem__(y) <==> del od[y]'
# Deleting an existing item uses self.__map to find the link which is
# then removed by updating the links in the predecessor and successor nodes.
dict.__delitem__(self, key)
link = self.__map.pop(key)
link.prev.next = link.next
link.next.prev = link.prevThe benchmark compares the different implementations based a single trivial regular expression: /indecipherable|undecipherable/. You simply cannot claim a regex engine is faster than another with such a poor experiment. It is evident that Boyer–Moore string search algorithm will outshine any engine on that regular expression.
Sorry if I sound a bit pedantic, but there is a lot more to good Unicode support than using wide characters.
Useless? I dear to say that number theory is currently the most lucrative field of mathematics. Without number theory, modern day cryptography would not exist and thus everything that depends on secure communication of information would not exist. So forget about commerce over the Internet, bank wire transfers, credit cards, administrating computers remotely and, most importantly, hiding your huge porn collection from your wife.
And, combinatorics is useful for the study of algorithms. It is pretty much the foundation of computer science.
In Python, the implementation is surprisingly succinct:
import sys
import random
import collections
MAXGEN = 10000
NONWORD = ""
suffixchain = collections.defaultdict(list)
w1 = w2 = NONWORD
for line in sys.stdin:
for word in line.split():
suffixchain[(w1, w2)].append(word)
w1, w2 = w2, word
suffixchain[(w1, w2)].append(NONWORD)
w1 = w2 = NONWORD
for i in range(MAXGEN):
suffixes = suffixchain[(w1, w2)]
next = random.choice(suffixes)
if next is NONWORD:
break
print next,
w1, w2 = w2, next
To use it, just run: $ python markov.py < english_corpus.txt"When you update information, we usually keep a backup copy of the prior version for a reasonable period of time to enable reversion to the prior version of that information."
Well, that surely is evil, yet perfectly valid C code. But personally, I don't find it surprising. Of course, you need to grok what A[n] really is -- i.e., syntactic sugar for *(A + n), as you just explained.