We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
With the development of the Internet and wide applications of databases, the databases providers are worrying about their ownership of the databases. Combined with the digital wat...
The continuum function F on regular cardinals is known to have great freedom; if , are regular cardinals, then F needs only obey the following two restrictions: (1) cf(F()) > ...
Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where u...
We develop a new multiclass classification method that reduces the multiclass problem to a single binary classifier (SBC). Our method constructs the binary problem by embedding sm...