Sciweavers

1022 search results - page 101 / 205
» Logspace Complexity of Functions and Structures
Sort
View
IS
2008
14 years 10 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
JMLR
2007
137views more  JMLR 2007»
14 years 9 months ago
Building Blocks for Variational Bayesian Learning of Latent Variable Models
We introduce standardised building blocks designed to be used with variational Bayesian learning. The blocks include Gaussian variables, summation, multiplication, nonlinearity, a...
Tapani Raiko, Harri Valpola, Markus Harva, Juha Ka...
CMOT
1998
92views more  CMOT 1998»
14 years 9 months ago
SDML: A Multi-Agent Language for Organizational Modelling
A programming language which is optimized for modelling multi-agent interaction within articulated social structures such as organizations is described with several examples of it...
Scott Moss, Helen Gaylard, Steve Wallis, Bruce Edm...
KDD
2002
ACM
194views Data Mining» more  KDD 2002»
15 years 10 months ago
Scale Space Exploration For Mining Image Information Content
Images are highly complex multidimensional signals, with rich and complicated information content. For this reason they are difficult to analyze through a unique automated approach...
Mariana Ciucu, Patrick Héas, Mihai Datcu, J...
EVOW
2008
Springer
14 years 11 months ago
A Study of Some Implications of the No Free Lunch Theorem
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
Andrea Valsecchi, Leonardo Vanneschi