1431 search results - page 62 / 287 » The complexity of random ordered structures |
91
Voted
UAI
1998
15 years 1 months ago
1998
Dynamic probabilistic networks are a compact representation of complex stochastic processes. In this paper we examine how to learn the structure of a DPN from data. We extend stru...
112
Voted
ICCD
2004
IEEE
15 years 9 months ago
2004
IEEE
This paper presents a novel approach to reducing the complexity of the transient linear circuit analysis for a hybrid structured clock network. Topology reduction is first used to...
161
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Software testing is an expensive process, which is vital in the industry. Construction of the test-data in software testing requires the major cost and to decide which method to us...
96
Voted
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
In this paper we propose a novel approach to the perceptual interpretation of building facades that combines shape grammars, supervised classification and random walks. Procedural...
99
Voted
CALCO
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We extend the theory of (co-)spans as a means of providing an algebraic approach to complex interactions as they arise in software-intensive systems. In order to make int...