Sciweavers

1236 search results - page 64 / 248
» On the Hamkins approximation property
Sort
View
130
Voted
DCC
2011
IEEE
14 years 7 months ago
Some observations on HC-128
In this paper, we use linear approximations of the addition modulo 2n of three n-bit integers to identify linear approximations of g1, g2, the feedback functions of HC-128. This, i...
Subhamoy Maitra, Goutam Paul, Shashwat Raizada, Su...
ICA
2012
Springer
13 years 8 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...
112
Voted
PODS
2012
ACM
281views Database» more  PODS 2012»
13 years 3 months ago
Mergeable summaries
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang,...
112
Voted
MOBIHOC
2010
ACM
14 years 10 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
SDM
2011
SIAM
233views Data Mining» more  SDM 2011»
14 years 3 months ago
Multi-Instance Mixture Models
Multi-instance (MI) learning is a variant of supervised learning where labeled examples consist of bags (i.e. multi-sets) of feature vectors instead of just a single feature vecto...
James R. Foulds, Padhraic Smyth