2520 search results - page 97 / 504 » The complexity of approximating entropy |
104
click to vote
AUTOMATICA
2008
14 years 10 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
CSL
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
GRID
2003
Springer
15 years 3 months ago
2003
Springer
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
DCG
2010
14 years 7 months ago
2010
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
MOC
2010
14 years 5 months ago
2010
We consider the application of a perfectly matched layer (PML) technique to approximate solutions to the elastic wave scattering problem in the frequency domain. The PML is viewed ...