21108 search results - page 249 / 4222 » A General Class of Models of |
190
click to vote
EJC
2007
15 years 6 months ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
231
click to vote
CORR
2011
Springer
2011
Springer
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
15 years 1 months ago
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
175
click to vote
DIS
2009
Springer
16 years 1 months ago
2009
Springer
Multiple-instance learning (MIL) is a generalization of the supervised learning problem where each training observation is a labeled bag of unlabeled instances. Several supervised ...
145
click to vote
ENTCS
2000
15 years 6 months ago
2000
We present here a large family of concrete models for Girard and Reynolds polymorphism (System F), in a non categorical setting. The family generalizes the construction of the mod...
154
click to vote
SCN
2008
Springer
15 years 6 months ago
2008
Springer
While recent timed-release encryption (TRE) schemes are implicitly supported by a certificateless encryption (CLE) mechanism, the security models of CLE and TRE differ and there is...