We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
Solutions of the master equation are approximated using a hierarchy of models based on the solution of ordinary differential equations: the macroscopic equations, the linear noise...
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...