Sciweavers

1117 search results - page 52 / 224
» Equivalent Representations of Set Functions
Sort
View
IACR
2011
104views more  IACR 2011»
13 years 9 months ago
Collusion Resistant Obfuscation and Functional Re-encryption
Program Obfuscation is the problem of transforming a program into one which is functionally equivalent, yet whose inner workings are completely unintelligible to an adversary. Des...
Nishanth Chandran, Melissa Chase, Vinod Vaikuntana...
ICML
2005
IEEE
15 years 10 months ago
A practical generalization of Fourier-based learning
This paper presents a search algorithm for finding functions that are highly correlated with an arbitrary set of data. The functions found by the search can be used to approximate...
Adam Drake, Dan Ventura
ICIP
2009
IEEE
15 years 10 months ago
Principal Moments For Efficient Representation Of 2d Shape
The analytic signature is a recently proposed 2D shape representation scheme. It is tailored to the representation of shapes described by arbitrary sets of unlabeled points, or la...
77
Voted
ICONIP
2007
14 years 11 months ago
Flexible Component Analysis for Sparse, Smooth, Nonnegative Coding or Representation
In the paper, we present a new approach to multi-way Blind Source Separation (BSS) and corresponding 3D tensor factorization that has many potential applications in neuroscience an...
Andrzej Cichocki, Anh Huy Phan, Rafal Zdunek, Liqi...
OL
2010
77views more  OL 2010»
14 years 8 months ago
A note on Burer's copositive representation of mixed-binary QPs
In an important paper, Burer [2] recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional i...
Immanuel M. Bomze, Florian Jarre