Sciweavers

934 search results - page 40 / 187
» exact 2007
Sort
View
JALC
2007
84views more  JALC 2007»
14 years 9 months ago
Enumeration of Context-Free Languages and Related Structures
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
Michael Domaratzki, Alexander Okhotin, Jeffrey Sha...
IPL
2007
104views more  IPL 2007»
14 years 9 months ago
A linear-time algorithm for Euclidean feature transform sets
The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the fun...
Wim H. Hesselink
ARSCOM
2008
110views more  ARSCOM 2008»
14 years 8 months ago
Total Perfect Codes in Tensor Products of Graphs
A total perfect code in a graph is a subset of the graph's vertices with the property that each vertex in the graph is adjacent to exactly one vertex in the subset. We prove t...
Ghidewon Abay-Asmerom, Richard Hammack, Dewey T. T...
AUTOMATICA
2005
94views more  AUTOMATICA 2005»
14 years 9 months ago
Algorithms for deterministic balanced subspace identification
New algorithms for identification of a balanced state space representation are proposed. They are based on a procedure for the estimation of impulse response and sequential zero i...
Ivan Markovsky, Jan C. Willems, Paolo Rapisarda, B...
NN
2008
Springer
101views Neural Networks» more  NN 2008»
14 years 9 months ago
On multidimensional scaling and the embedding of self-organising maps
The self-organising map (SOM) and its variant, visualisation induced SOM (ViSOM), have been known to yield similar results to multidimensional scaling (MDS). However, the exact co...
Hujun Yin