Sciweavers

114 search results - page 2 / 23
» The Tree Inclusion Problem: In Linear Space and Faster
Sort
View
ICML
2006
IEEE
14 years 5 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan
DBPL
2007
Springer
158views Database» more  DBPL 2007»
13 years 8 months ago
Efficient Algorithms for the Tree Homeomorphism Problem
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
Michaela Götz, Christoph Koch, Wim Martens
CACM
2010
104views more  CACM 2010»
13 years 4 months ago
Faster dimension reduction
Data represented geometrically in high-dimensional vector spaces can be found in many applications. Images and videos, are often represented by assigning a dimension for every pix...
Nir Ailon, Bernard Chazelle
SIAMCO
2010
128views more  SIAMCO 2010»
13 years 3 months ago
A Parallel Splitting Method for Coupled Monotone Inclusions
A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces, and its convergence is established under the assumption that solutions...
Hedy Attouch, Luis M. Briceño-Arias, Patric...
JMLR
2006
105views more  JMLR 2006»
13 years 4 months ago
Linear State-Space Models for Blind Source Separation
We apply a type of generative modelling to the problem of blind source separation in which prior knowledge about the latent source signals, such as time-varying auto-correlation a...
Rasmus Kongsgaard Olsson, Lars Kai Hansen