3244 search results - page 15 / 649 » On convex complexity measures |
100
click to vote
JCIT
2010
14 years 6 months ago
2010
In 2008, Wang et. al. first investigate a sort of specific secure multi-party computation--secure convex hull two-party computation, and construct two protocols based on Gift wrap...
ICIP
2008
IEEE
15 years 5 months ago
2008
IEEE
This paper addresses the image representation problem in visual sensor networks. We propose a new image representation scheme based on compressive sensing (CS) because compressive...
136
click to vote
ISIPTA
2005
IEEE
15 years 4 months ago
2005
IEEE
Sets of probability measures which form neighbourhoods of classical probability measures are studied. An application of Jeffrey’s rule of conditioning to forming neighbourhoods...
102
click to vote
DGCI
2006
Springer
15 years 1 months ago
2006
Springer
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. In [1], an algorithm which perform...
NIPS
2003
15 years 18 days ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...