Calculate the objective function ||Ax-y|| + \lambda |x|_1

Returns a sequence representation of le-lists. The order of the lists is unspecified.

partitions graph by finding an approximation of the second eigenvector of the graph laplacian (the Fiedler vector). It then splits based on the median

Pop an item from the bottom of the queue. Only the owning thread can pop from this end. This must not be called by any other thread.

Pop an item from the top of the queue, i.e., the end that is not pushed onto. Threads other than the owner can use this function. Returns {job, empty

Find nearest neighbor for each point. Go down to each leaf, and then search from leaf.

Find points in range r for each point. Go down to each leaf, and then search from leaf.

Adds a new job to the bottom of the queue. Only the owning thread can push new items. This must not be called by any other thread. Returns true if th

The main recursive function Points are all the original points, l and r are the start and endpoints to find the hull between, and Idxs are the indices

Generate a random vector of length n consisting of random non-negative 32-bit integers.

Code for ray_triangle_intersect is based on: Fast, Minimum Storage Ray/Triangle Intersection Tomas Moller and Ben Trumbore

Read from a csv file with one entry (sample) per line. First line spefies the types of each column (feature), either 'd' (discrete) or 'i' (continuou

Read matlab data file. Returns A^T (i.e. the transpose of A, organizized as columns), and y.

Given the ID back to the global pool for reuse

transposes the matrix making a sequence of features also places the target label up front (taken from the back)

Calculates local forces within a leaf

A zero-byte-filled sequence always corresponds to an empty sequence, whether small or large

Process one column, i.e., the meat. Find local gradient at coordinate and update xi and Ax.

Return the size of the sequence

To deal with no gradient of the absolute value at 0.

Iterative solver AT is the tranpsose of A, organized as colums

Push onto local stack.

pair of total currently used space, and total unused space the allocator has in reserve

Translate and accumulate exterior (multipole) expansions up the tree, including translating particles to expansions at the leaves.

The top-level call has to find the maximum and minimum x coordinates and use them for the initial recursive call

check if point p violates the constraint h

toplevel routine The result is left in the hashmap mesh. It includes all triangles in the final mesh. Assumes points are inside unit square to fit en