194 search results - page 35 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
151
click to vote
SIAMIS
2011
14 years 10 months ago
2011
We define a novel metric on the space of closed planar curves which decomposes into three intuitive components. According to this metric centroid translations, scale changes and ...
119
click to vote
COLT
2000
Springer
15 years 8 months ago
2000
Springer
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
120
Voted
JAIR
2006
15 years 3 months ago
2006
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...
116
Voted
URBAN
2008
15 years 3 months ago
2008
: There is a long tradition of describing cities through a focus on the characteristics of their residents. A brief review of the history of this approach to describing cities high...
120
Voted
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...