Sciweavers

6404 search results - page 462 / 1281
» Blocks
Sort
View
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
13 years 9 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
ICDCS
2012
IEEE
13 years 9 months ago
Scaling Down Off-the-Shelf Data Compression: Backwards-Compatible Fine-Grain Mixing
—Pu and Singaravelu presented Fine-Grain Mixing, an adaptive compression system which aimed to maximize CPU and network utilization simultaneously by splitting a network stream i...
Michael Gray, Peter Peterson, Peter L. Reiher
FDTC
2009
Springer
189views Cryptology» more  FDTC 2009»
16 years 1 months ago
KeeLoq and Side-Channel Analysis-Evolution of an Attack
—Last year we were able to break KeeLoq, which is a 64 bit block cipher that is popular for remote keyless entry (RKE) systems. KeeLoq RKEs are widely used for access control pur...
Christof Paar, Thomas Eisenbarth, Markus Kasper, T...
168
Voted
SPAA
2010
ACM
15 years 11 months ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...
CP
2006
Springer
15 years 8 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer