Sciweavers

339 search results - page 41 / 68
» Universality Results for Models in Locally Boolean Domains
Sort
View
CSDA
2007
94views more  CSDA 2007»
13 years 8 months ago
Some extensions of score matching
Many probabilistic models are only defined up to a normalization constant. This makes maximum likelihood estimation of the model parameters very difficult. Typically, one then h...
Aapo Hyvärinen
WWW
2008
ACM
14 years 9 months ago
Exploring social annotations for information retrieval
Social annotation has gained increasing popularity in many Web-based applications, leading to an emerging research area in text analysis and information retrieval. This paper is c...
Ding Zhou, Jiang Bian, Shuyi Zheng, Hongyuan Zha, ...
CIE
2007
Springer
14 years 2 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
ENVSOFT
2011
134views more  ENVSOFT 2011»
13 years 3 months ago
Modelling and simulation of a jet fan for controlled air flow in large enclosures
Jet fans are applied for control of air flow and support of pollutant dispersal in large enclosures. In The Netherlands, application is well known for car parks as part of the fir...
B. J. M. v. d. Giesen, S. H. A. Penders, M. G. L. ...
AAAI
1997
13 years 10 months ago
The Scaling of Search Cost
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby...