dkohlsdorf

dkohlsdorf

from lxml import html
import requests
import urllib.request


BASE_URL = 'https://papers.nips.cc/'
page = requests.get(BASE_URL)
tree = html.fromstring(page.content)
books = [ href.attrib['href'] for href in tree.xpath('//a') if 'book' in href.attrib['href']]

dkohlsdorf

class Alignment[A](
  init: (Int, Int) => Double,
  rank: (Double, Double, Double, A, A) => Double
) {

  def score(x: Array[A], y: Array[A]): Double = {  
    val n  = x.size
    val m  = y.size
    val dp = Array.ofDim[Double](n + 1, m + 1)

dkohlsdorf

                                     ,~~+++===~:,,,,
                                 ,,:=+==~~~=~========::,
                               ,:++?=~::~~~~~~~~~~=~====:,
                           ,::=?+=~~~~~~~~::::::::~~~~~~~~==~:
                       ,,:=?+?=~~~~~:~~~~~~::::::::::::::~====~:,
                      :++???=~~~::::~:~~~::,,,,,,,,,:::,::::~~=++~,
                     ,~+++===~~:::::::::::,,,,,,,,,,,,,,,,:::~~==?=,
                  , ,+?+==~~::::::::::,,,,,,,..........,,,,,,~~~==?=,
                  =~?+???=~::::::,,,,,,,,,,,,..............,,~~=+??+=:
                 +++=+====~:::::,,,,,,,,,,,,,...............,,,,~++===+:

dkohlsdorf

//Given two sparse vectors. Write a function to find a dot product of these vectors.

// [0,4,0,0,1,0,0,10,0] 
// [2,0,0,0,3,0,0,0,0]

// 3

x = (4, 1), (1, 4), (10, 7)
y = (2, 0), (3, 4)

dkohlsdorf

package processing.signals;

import java.util.ArrayList;

/**
 * Extract all local features from current spectrogram
 * 
 * @author Daniel Kohlsdorf
 */
public class LocalFeatureExtractor {	

dkohlsdorf

package parser;

public class ExpressionNode {

	public static final char or = '|';
	public static final char and = '.';
	public static final char repeat = '*';

	public char symbol;
	public ExpressionNode left, right;

dkohlsdorf

public class BitSet {

	private int set = 0;
	
	public void add(int position) {
		int mask = 1 << position;
		set = set | mask;
	}

dkohlsdorf

import java.util.Arrays;

/**
 * Implements a size limited heap
 * 
 * @author Daniel Kohlsdorf
 */
public class Heap {

	private double heap[];

dkohlsdorf

import java.util.Arrays;

/**
 * Merge as in MergeSort
 * 
 * @author Daniel Kohlsdorf
 */
public class Merge {

	public static int[] merge(int x[], int y[]) {