Sciweavers

Share
IACR
2011
166views more  IACR 2011»
8 years 2 months ago
Bicliques for Preimages: Attacks on Skein-512 and the SHA-2 family
We introduce a new concept in splice-and-cut attacks on hash functions, which bridges the gap between preimage attacks and a powerful method of differential cryptanalysis. The ne...
Dmitry Khovratovich, Christian Rechberger, Alexand...
ASUNAM
2011
IEEE
8 years 2 months ago
MultiAspectForensics: Pattern Mining on Large-Scale Heterogeneous Networks with Tensor Analysis
—Modern applications such as web knowledge base, network traffic monitoring and online social networks have made available an unprecedented amount of network data with rich type...
Koji Maruhashi, Fan Guo, Christos Faloutsos
FGR
2011
IEEE
354views Biometrics» more  FGR 2011»
8 years 6 months ago
Hierarchical ranking of facial attributes
Abstract— We propose a novel hierarchical structured prediction approach for ranking images of faces based on attributes. We view ranking as a bipartite graph matching problem; l...
Ankur Datta, Rogerio Feris, Daniel A. Vaquero
TCOM
2011
170views more  TCOM 2011»
8 years 9 months ago
On Girth Conditioning for Low-Density Parity-Check Codes
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
Samuele Bandi, Velio Tralli, Andrea Conti, Maddale...
CVPR
2011
IEEE
8 years 10 months ago
Cross-View Action Recognition via View Knowledge Transfer
In this paper, we present a novel approach to recognizing human actions from different views by view knowledge transfer. An action is originally modelled as a bag of visual-words ...
Jingen Liu
CORR
2010
Springer
120views Education» more  CORR 2010»
8 years 12 months ago
Typicality Graphs:Large Deviation Analysis
Let X and Y be finite alphabets and PXY a joint distribution over them, with PX and PY representing the marginals. For any > 0, the set of n-length sequences xn and yn that ar...
Ali Nazari, Ramji Venkataramanan, Dinesh Krithivas...
SIGECOM
2010
ACM
153views ECommerce» more  SIGECOM 2010»
9 years 29 days ago
Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads
We derive efficient algorithms for both detecting and representing matchings in lopsided bipartite graphs; such graphs have so many nodes on one side that it is infeasible to repr...
Denis Charles, Max Chickering, Nikhil R. Devanur, ...
SIAMDM
2010
96views more  SIAMDM 2010»
9 years 29 days ago
Note on Bipartite Graph Tilings
Let s < t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure t...
Jan Hladký, Mathias Schacht
JCT
2010
135views more  JCT 2010»
9 years 1 months ago
Countable connected-homogeneous graphs
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
Robert Gray, D. Macpherson
IV
2010
IEEE
193views Visualization» more  IV 2010»
9 years 1 months ago
Drawing Clustered Bipartite Graphs in Multi-circular Style
Abstract—Bipartite graphs are often used to illustrate relationships between two sets of data, such as web pages and visitors. At the same time, information is often organized hi...
Takao Ito, Kazuo Misue, Jiro Tanaka
books