Sciweavers

3600 search results - page 294 / 720
» The settling-time reducibility ordering
Sort
View
GI
2008
Springer
15 years 7 months ago
Simple Back-end Services for Corporate Semantic Web
In order to be adopted within corporate environments, Semantic Web applications must provide tangible short-/medium-term gains. Although corporate Semantic Web offers enterprises n...
Robert Tolksdorf, Radoslaw Oldakowski, Thomas Hopp...
149
Voted
ICASSP
2010
IEEE
15 years 6 months ago
Large margin filtering for Signal Sequence Labeling
Signal Sequence Labeling consists in predicting a sequence of labels given an observed sequence of samples. A naive way is to filter the signal in order to reduce the noise and t...
Rémi Flamary, Benjamin Labbé, Alain ...
ALGORITHMICA
2008
52views more  ALGORITHMICA 2008»
15 years 6 months ago
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
V. Berry, Z. S. Peng, H. F. Ting
AUTOMATICA
2008
83views more  AUTOMATICA 2008»
15 years 6 months ago
Periodic smoothing splines
Periodic smoothing splines appear for example as generators of closed, planar curves, and in this paper they are constructed using a controlled two point boundary value problem in...
Hiroyuki Kano, Magnus Egerstedt, Hiroyuki Fujioka,...
AUTOMATICA
2008
74views more  AUTOMATICA 2008»
15 years 6 months ago
Krylov projection framework for Fourier model reduction
This paper analyzes the Fourier model reduction (FMR) method from a rational Krylov projection framework and shows how the FMR reduced model, which has guaranteed stability and a ...
Serkan Gugercin, Karen Willcox