Sciweavers

11160 search results - page 151 / 2232
» Incompleteness in a General Setting
Sort
View
JCAM
2011
69views more  JCAM 2011»
14 years 6 months ago
Comonotonic approximations for a generalized provisioning problem with application to optimal portfolio selection
In this paper we discuss multiperiod portfolio selection problems related to a speci…c provisioning problem. Our results are an extension of Dhaene et al. (2005), where optimal ...
Koen Van Weert, Jan Dhaene, Marc J. Goovaerts
CVPR
2012
IEEE
13 years 6 months ago
General trajectory prior for Non-Rigid reconstruction
Trajectory basis Non-Rigid Structure From Motion (NRSFM) currently faces two problems: the limit of reconstructability and the need to tune the basis size for different sequences....
Jack Valmadre, Simon Lucey
IPL
2008
135views more  IPL 2008»
15 years 3 months ago
On the Positive-Negative Partial Set Cover problem
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
Pauli Miettinen
125
Voted
COMBINATORICS
2007
83views more  COMBINATORICS 2007»
15 years 3 months ago
On Small Dense Sets in Galois Planes
This paper deals with new infinite families of small dense sets in desarguesian projective planes PG(2, q). A general construction of dense sets of size about 3q2/3 is presented....
Massimo Giulietti
ENTCS
2008
87views more  ENTCS 2008»
15 years 4 months ago
Checking Emptiness of Non-Deterministic Regular Types with Set Operators
An algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterized type definitions is presented. The algorithm generalizes previous...
Lunjin Lu