Sciweavers

Share
JMLR
2012
7 years 5 months ago
Perturbation based Large Margin Approach for Ranking
We consider the task of devising large-margin based surrogate losses for the learning to rank problem. In this learning to rank setting, the traditional hinge loss for structured ...
Eunho Yang, Ambuj Tewari, Pradeep D. Ravikumar
IACR
2011
106views more  IACR 2011»
8 years 2 months ago
Unaligned Rebound Attack - Application to Keccak
We analyze the internal permutations of Keccak, one of the NIST SHA-3 competition finalists, in regard to differential properties. By carefully studying the elements composing th...
Alexandre Duc, Jian Guo 0001, Thomas Peyrin, Lei W...
ECCC
2011
282views ECommerce» more  ECCC 2011»
8 years 9 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Noga Alon, Shachar Lovett
TIT
2010
170views Education» more  TIT 2010»
8 years 9 months ago
Correcting charge-constrained errors in the rank-modulation scheme
We investigate error-correcting codes for a the rank-modulation scheme with an application to flash memory devices. In this scheme, a set of n cells stores information in the permu...
Anxiao Jiang, Moshe Schwartz, Jehoshua Bruck
JCT
2011
57views more  JCT 2011»
8 years 9 months ago
Generalized Stirling permutations, families of increasing trees and urn models
Bona [6] studied the distribution of ascents, plateaux and descents in the class of Stirling permutations, introduced by Gessel and Stanley [14]. Recently, Janson [18] showed the c...
Svante Janson, Markus Kuba, Alois Panholzer
CORR
2011
Springer
188views Education» more  CORR 2011»
8 years 9 months ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin
ALGORITHMICA
2011
8 years 9 months ago
Common Intervals of Multiple Permutations
Abstract Given k permutations of n elements, a k-tuple of intervals of these permutations consisting of the same set of elements is called a common interval. We present an algorith...
Steffen Heber, Richard Mayr, Jens Stoye
SIAMDM
2010
128views more  SIAMDM 2010»
9 years 26 days ago
Permutation Capacities of Families of Oriented Infinite Paths
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
Graham Brightwell, Gérard D. Cohen, Emanuel...
LATINCRYPT
2010
9 years 27 days ago
Generic Attacks on Misty Schemes
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
Valérie Nachef, Jacques Patarin, Joana Treg...
JCT
2010
117views more  JCT 2010»
9 years 28 days ago
(2+2)-free posets, ascent sequences and pattern avoiding permutations
Abstract. We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2 + 2)-free posets and a certain class of involutions (or chord ...
Mireille Bousquet-Mélou, Anders Claesson, M...
books