Sciweavers

499 search results - page 31 / 100
» Multilevel algorithms for linear ordering problems
Sort
View
IJCNLP
2004
Springer
14 years 2 months ago
Statistical Substring Reduction in Linear Time
We study the problem of efficiently removing equal frequency n-gram substrings from an n-gram set, formally called Statistical Substring Reduction (SSR). SSR is a useful operatio...
Xueqiang Lü Le Zhang, Junfeng Hu
JACM
2010
116views more  JACM 2010»
13 years 7 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
NN
2006
Springer
128views Neural Networks» more  NN 2006»
13 years 9 months ago
Topographic map formation of factorized Edgeworth-expanded kernels
We introduce a new learning algorithm for topographic map formation of Edgeworth-expanded Gaussian activation kernels. In order to avoid the rapid increase in kernel parameters, a...
Marc M. Van Hulle
DAGSTUHL
2008
13 years 10 months ago
Uniprocessor EDF Feasibility is an Integer Problem
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
Enrico Bini
JMLR
2008
209views more  JMLR 2008»
13 years 9 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger