Sciweavers

3373 search results - page 365 / 675
» Linear transformations on codes
Sort
View
DM
2010
77views more  DM 2010»
15 years 4 months ago
Representing (0, 1)-matrices by boolean circuits
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...
Stasys Jukna
138
Voted
ADCM
1998
133views more  ADCM 1998»
15 years 3 months ago
Numerical exploitation of symmetry in integral equations
: Linear integral operators describing physical problems on symmetric domains often are equivariant, which means that they commute with certain symmetries, i.e., with a group of or...
Eugene L. Allgower, Kurt Georg
TSMC
2011
228views more  TSMC 2011»
14 years 11 months ago
Privacy-Preserving Outlier Detection Through Random Nonlinear Data Distortion
— Consider a scenario in which the data owner has some private/sensitive data and wants a data miner to access it for studying important patterns without revealing the sensitive ...
Kanishka Bhaduri, Mark D. Stefanski, Ashok N. Sriv...
PLDI
1996
ACM
15 years 8 months ago
Realistic Compilation by Partial Evaluation
Two key steps in the compilation of strict functional languages are the conversion of higher-order functions to data structures (closures) and the transformation to tail-recursive...
Michael Sperber, Peter Thiemann
CVPR
1998
IEEE
16 years 6 months ago
Generation of the Euclidean Skeleton from the Vector Distance Map by a Bisector Decision Rule
The Euclidean skeleton is essential for general shape representation. This paper provides an e cient method to extract a well-connected Euclidean skeleton by a neighbor bisector d...
Hong Li, Albert M. Vossepoel