Sciweavers

3244 search results - page 4 / 649
» On convex complexity measures
Sort
View
PR
2007
116views more  PR 2007»
15 years 27 days ago
GAPS: A clustering method using a new point symmetry-based distance measure
In this paper, an evolutionary clustering technique is described that uses a new point symmetry-based distance measure. The algorithm is therefore able to detect both convex and n...
Sanghamitra Bandyopadhyay, Sriparna Saha
ISIPTA
2005
IEEE
118views Mathematics» more  ISIPTA 2005»
15 years 7 months ago
Envelope Theorems and Dilation with Convex Conditional Previsions
This paper focuses on establishing envelope theorems for convex conditional lower previsions, a recently investigated class of imprecise previsions larger than coherent imprecise ...
Renato Pelessoni, Paolo Vicig
CCCG
2008
15 years 2 months ago
Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis
We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...
Jérémy Barbay, Eric Y. Chen
TCOM
2010
111views more  TCOM 2010»
14 years 11 months ago
Design of irregular LDPC codes with optimized performance-complexity tradeoff
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
Benjamin Smith, Masoud Ardakani, Wei Yu, Frank R. ...
CVPR
2010
IEEE
15 years 7 months ago
Face Recognition Based on Image Sets
We introduce a novel method for face recognition from image sets. In our setting each test and training example is a set of images of an individual’s face, not just a single ima...
Hakan Cevikalp, Bill Triggs