2629 search results - page 372 / 526 » complex 2009 |
151
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
130
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
129
click to vote
PPDP
2009
Springer
15 years 11 months ago
2009
Springer
Many recent research projects focus on language support for behavioral software contracts, that is, assertions that govern the boundaries between software building blocks such as ...
131
click to vote
PSIVT
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we propose a novel algorithm, named as Spatially Varying Transform (SVT). The basic idea of SVT is that we do not restrict the transform coding inside normal block b...
136
click to vote
REFSQ
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. [Context and motivation] Ever-growing systems’ complexity and novel requirements engineering approaches such as reuse or globalization imply that requirements are produ...