Password Pat
- -
Password Pat is known for making slick passwords such
as
@hwl2rt&tk
which is derived from the sentence
At Hogwarts we love to roast tyrants and tea kettles.
by applying the followin
The Child's Cipher
- - -
As a child, I would often encrypt my journal using a
simple substitution cipher. In this cipher, vowels
(a,e,i,o,u,y) would be replaced with the next vowel, and
consonants wou
Introduction to Algorithms
6.046J/18.401J/SMA5503
Lecture 12
Prof. Erik Demaine
Computational geometry
Algorithms for solving geometric problems in 2D and higher. Fundamental objects: Basic structures
Algorithms
LECTURE 13
Amortized Analysis Dynamic tables Aggregate method Accounting method Potential method Professor Ashok Subramanian
Algorithms L13.1
How large should a hash table be?
Goal: Make th
Authorship Verification
- -
Slippery Redux, the Text Private Eye, is trying to set
up a system to catch text copycats. To do this he needs
a program that will take input text and count the words
that
Bebumblia Communications
- -
The perfectly flat planet of beebumblia is occupied by
two warrior races, the bees and the beebears. They are
fighting a war, of course.
The bees are having trouble with t
COMENTARIOS
8TH INTERNATIONAL IUFRO WOOD DRYING CONFERENCE
BRASOV-ROMANIA, AUGUST 2429,2003
l? PerrC1and M. Campean2
'LERMAB (Laboratory of Wood Science), UMR INRA-ENGREF-UHP 1093
14 rue Girardet, F-5
Love Log
- -
Olivia, the arrow beetle, is on the ground near a log.
On the other side of the log is Oliver, the love of her
life. She wants to get to him. How far must she
travel?
Olivia and Oliver ar
Huffman Coding Trees
- - -
Huffman Coding is a method of compressing data. It is
based on specialized binary trees, which we will call
Huffman Coding Trees.
A Huffman Coding Tree for (compressing) the
GSAT Tracing
- -
GSAT is a `greedy local search' procedure for satisfying
propositional formulae in CNF form. You have been asked
to code the GSAT algorithm, and as a first step, you are
to code a var
Design Optimal Gear Ratios
- - - -
As an engineer for the Bicycle Sprint Club, you are re-
sponsible for choosing gear ratios for the bikes. The
rules of sprint racing say that the bicycle can have
on
Feature Structures
- -
Information can be encoded in `feature structures',
which are rooted labeled graphs. To explain, a
feature structure is a set of graph nodes (points), a
set of directed edges be
The 1D Drunkard
- - -
Some scientific algorithms require random numbers as
input. However, with modern inexpensive computers,
which do not have error detecting RAM memory, it is
also important to be a
Dice Quiz
- -
You have become involved in writing software for a game
that is played with 6-sided dice. A die is placed on
a board so that one of its faces is North, and the die
is then moved by rolli
Changing Point of View
- - - -
TeffalHead FatBody has stayed out too late on the planet
BadTrash and is in danger of being consumed by a Larger
BageGarLectorCol. To get to safety TeffalHead must get
t
Algorithms
LECTURE 11
Augmenting Data Structures Dynamic order statistics Methodology Interval trees Professor Ashok Subramanian
Algorithms L11.1
Dynamic order statistics
OS-SELECT(i, S): returns the
Algorithms
LECTURE 10
Balanced Search Trees Red-black trees Height of a red-black tree Rotations Insertion
Professor Ashok Subramanian
Algorithms L7.1
Balanced search trees
Balanced search tree: A sea
Transducer Problem
- -
An NDFT, or non-deterministic finite transducer, is an
NDFA, a non-deterministic finite automaton, with output.
We will first describe NDFA's and introduce the notation
we will
General GXMD's Tour
- - -
General GXMD, who lives in 5 dimensions, is responsible
for the home defense force in a sector of the galaxy
with N planets. The planets are conveniently named
1, 2, 3, ., N.
The Number Game
- - -
The Society of Misplaced Mathematicians likes to play a
game called TNG, The Number Game, which is like tic-tac-
toe, except that at each stage there are only two pos-
sible move
Bisecting a Square
- - -
You are given a point A on or within the unit square
bordered by (0,0), (0,1), (1, 0), and (1,1), and a point
B on the boundary of that square. Find another point C
on the bou