Tag #permutation
85 papers:
ICML-2019-NamKMPSF #classification #learning #multi- Learning Context-dependent Label Permutations for Multi-label Classification (JN, YBK, ELM, SP, RS, JF), pp. 4733–4742.
KDD-2019-NetoPPTBMO #approach #health #machine learning- A Permutation Approach to Assess Confounding in Machine Learning Applications for Digital Health (ECN, AP, TMP, MT, BMB, LM, LO), pp. 54–64.
- ICML-2018-JiaoV #higher-order #kernel
- The Weighted Kendall and High-order Kernels for Permutations (YJ, JPV), pp. 2319–2327.
- KDD-2018-PellegrinaV #mining #mutation testing #performance #testing
- Efficient Mining of the Most Significant Patterns with Permutation Testing (LP, FV), pp. 2070–2079.
DLT-2017-ZantemaB #sequence #transducer- Classifying Non-periodic Sequences by Permutation Transducers (HZ, WB), pp. 365–377.
- ICML-2017-ShamirS #feedback #learning #online
- Online Learning with Local Permutations and Delayed Feedback (OS, LS), pp. 3086–3094.
- ICFP-2016-ChristiansenDD #functional
- All sorts of permutations (functional pearl) (JC, ND, SD), pp. 168–179.
- ICML-2016-LimW #approach #problem
- A Box-Constrained Approach for Hard Permutation Problems (CHL, SW), pp. 2454–2463.
ASE-2016-StratisR #execution #testing- Test case permutation to improve execution time (PS, AR), pp. 45–50.
CASE-2016-Ritt #algorithm #bound #problem #scheduling- A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem (MR), pp. 872–877.
VLDB-2015-NaidanBN #performance- Permutation Search Methods are Efficient, Yet Faster Search is Possible (BN, LB, EN), pp. 1618–1629.
CIAA-2015-Madejski #linear #problem- The Membership Problem for Linear and Regular Permutation Languages (GM), pp. 211–223.
- DLT-2015-AvgustinovichFP #complexity #infinity
- Ergodic Infinite Permutations of Minimal Complexity (SVA, AEF, SP), pp. 71–84.
- DLT-2015-CurrieMN
- Unary Patterns with Permutations (JDC, FM, DN), pp. 191–202.
- ICML-2015-JiaoV #kernel
- The Kendall and Mallows Kernels for Permutations (YJ, JPV), pp. 1935–1944.
- KDD-2015-Llinares-LopezS #mining #mutation testing #performance #testing
- Fast and Memory-Efficient Significant Pattern Mining via Permutation Testing (FLL, MS, LP, KMB), pp. 725–734.
STOC-2015-Czumaj #network #random #using- Random Permutations using Switching Networks (AC), pp. 703–712.
- VLDB-2014-WeiYLJ #approach #independence #query #reachability
- Reachability Querying: An Independent Permutation Labeling Approach (HW, JXY, CL, RJ), pp. 1191–1202.
ILC-2014-SmithP #finite #lisp #performance- Efficient Finite Permutation Groups and Homomesy Computation in Common Lisp (RS, BP), p. 60.
- ICML-c1-2014-Shrivastava0 #performance
- Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search (AS, PL), pp. 557–565.
- KDD-2014-WangSE #collaboration #learning
- Active collaborative permutation learning (JW, NS, JE), pp. 502–511.
IJCAR-2014-NigamRL #automation #named #proving- Quati: An Automated Tool for Proving Permutation Lemmas (VN, GR, LL), pp. 255–261.
- VLDB-2013-Thonangi0
- Permuting Data on Random-Access Block Storage (RT, JY), pp. 721–732.
- DLT-2012-ManeaMN
- The Avoidability of Cubes under Permutations (FM, MM, DN), pp. 416–427.
MLDM-2012-KalpakisYHMSSS #analysis #predict #using- Outcome Prediction for Patients with Severe Traumatic Brain Injury Using Permutation Entropy Analysis of Electronic Vital Signs Data (KK, SY, PFMH, CFM, LGS, DMS, TMS), pp. 415–426.
SAC-2011-GalvaoD #distance #symmetry- Computing rearrangement distance of every permutation in the symmetric group (GRG, ZD), pp. 106–107.
- SAC-2011-TranCS #predict
- Prediction of permuted super-secondary structures in β-barrel proteins (VDT, PC, JMS), pp. 110–111.
DAC-2011-Stergiou #diagrams #network #order- Implicit permutation enumeration networks and binary decision diagrams reordering (SS), pp. 615–620.
SAT-2011-Minato #diagrams #named #performance #problem- πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space (SiM), pp. 90–104.
GT-VMT-2010-HermannCEK #analysis #equivalence #graph #performance #petri net- Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets (FH, AC, HE, BK).
- SAC-2010-BaudetD #algorithm
- An improved algorithm to enumerate all traces that sort a signed permutation by reversals (CB, ZD), pp. 1521–1525.
HPCA-2010-HuangSWSXM #named- SIF: Overcoming the limitations of SIMD devices via implicit permutation (LH, LS, ZW, WS, NX, SM), pp. 1–12.
HPDC-2010-PetrouSMFPD #mutation testing #optimisation #parallel #testing- Optimization of a parallel permutation testing function for the SPRINT R package (SP, TMS, MM, TF, MP, BD), pp. 516–521.
VMCAI-2010-PerrelleH #analysis #array- An Analysis of Permutations in Arrays (VP, NH), pp. 279–294.
- CIAA-2009-FreivaldsI #quantum #query
- Quantum Queries on Permutations with a Promise (RF, KI), pp. 208–216.
CIG-2009-LopezO #locality #on the #problem- On the effects of locality in a permutation problem: The Sudoku Puzzle (EGL, MO0), pp. 80–87.
DHM-2009-ClavelM #approach #modelling #multimodal #named- PERMUTATION: A Corpus-Based Approach for Modeling Personality and Multimodal Expression of Affects in Virtual Characters (CC, JCM), pp. 211–220.
DATE-2009-MilderHP #automation #generative #streaming- Automatic generation of streaming datapaths for arbitrary fixed permutations (PAM, JCH, MP), pp. 1118–1123.
ICALP-A-2008-TedderCHP #composition #linear #recursion- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations (MT, DGC, MH, CP), pp. 634–645.
- KDD-2008-HuYS #constraints #named #proximity
- Permu-pattern: discovery of mutable permutation patterns with proximity constraint (MH, JY, WS), pp. 318–326.
CC-2008-FranchettiP #generative- Generating SIMD Vectorized Permutations (FF, MP), pp. 116–131.
CIKM-2006-WangC #performance #query #sequence- Improving query I/O performance by permuting and refining block request sequences (XW, MC), pp. 652–661.
- ICML-2006-ShivaswamyJ #invariant
- Permutation invariant SVMs (PKS, TJ), pp. 817–824.
ICPR-v1-2006-KimC #ambiguity #clustering- ICA-Based Clustering for Resolving Permutation Ambiguity in Frequency-Domain Convolutive Source Separation (MK, SC), pp. 950–954.
PLDI-2006-RenWP #optimisation- Optimizing data permutations for SIMD devices (GR, PW, DAP), pp. 118–131.
- CASE-2006-ChandrasekaranSPV #algorithm #optimisation #problem #scheduling
- An Application of Particle Swarm Optimization Algorithm to Permutation Flowshop Scheduling Problems to Minimize Makespan, Total Flowtime and Completion Time Variance (SC, RKS, SGP, NV), pp. 513–518.
- CIKM-2005-HuangLH #approach #distributed #mining
- A new permutation approach for distributed association rule mining (YH, ZL, HH), pp. 351–352.
LCTES-2005-KudriavtsevK #generative- Generation of permutations for SIMD processors (AK, PMK), pp. 147–156.
- ICALP-2004-HooryMMR
- Simple Permutations Mix Well (SH, AM, SM, CR), pp. 770–781.
- ICALP-2004-Soltys #calculus
- LA, Permutations, and the Hajós Calculus (MS), pp. 1176–1187.
- IJCAR-2004-Avenhaus #algorithm #performance
- Efficient Algorithms for Computing Modulo Permutation Theories (JA), pp. 415–429.
- ICALP-2003-MunroRRR
- Succinct Representations of Permutations (JIM, RR, VR, SSR), pp. 345–356.
- ICML-2003-KirshnerPS #learning
- Unsupervised Learning with Permuted Data (SK, SP, PS), pp. 345–352.
PDP-2003-VeselovskyB #case study- A Study of the Permutation Capability of a Binary Hypercube under Deterministic Dimension-order Routing (GV, DAB), p. 173–?.
- STOC-2003-ItohTT #independence #on the #strict
- On the sample size of k-restricted min-wise independent permutations and other k-wise distributions (TI, YT, JT), pp. 710–719.
CADE-2003-CohenMPS #problem- Certifying Solutions to Permutation Group Problems (AMC, SHM, MP, VS), pp. 258–273.
- ICML-2002-LebanonL #modelling #named #probability #ranking #using
- Cranking: Combining Rankings Using Conditional Probability Models on Permutations (GL, JDL), pp. 363–370.
- DLT-2001-Prodinger #word
- Words, Permutations, and Representations of Numbers (HP), pp. 81–99.
- ICALP-2001-CormodeMS #editing
- Permutation Editing and Matching via Embeddings (GC, SM, SCS), pp. 481–492.
- STOC-2001-Vocking
- Almost optimal permutation routing on hypercubes (BV), pp. 530–539.
LICS-2001-BouajjaniMT #algorithm #verification- Permutation Rewriting and Algorithmic Verification (AB, AM, TT), pp. 399–408.
- ICALP-2000-Broder #independence #theory and practice
- Min-wise Independent Permutations: Theory and Practice (AZB), p. 808.
- ICPR-v4-2000-ColiosT #identification #invariant
- Landmark Identification Based on Projective and Permutation Invariant Vectors (CIC, PET), pp. 4128–4131.
- SAC-1999-Julstrom #heuristic
- Coding TSP Tours as Permutations via an Insertion Heuristic (BAJ), pp. 297–301.
- HPCA-1999-SchwarzSB #development #layout
- Permutation Development Data Layout (PDDL) (TJES, JS, WAB), pp. 214–217.
- ICML-1998-FrankW98a #mutation testing #using
- Using a Permutation Test for Attribute Selection in Decision Trees (EF, IHW), pp. 152–160.
- STOC-1998-BroderCFM #independence
- Min-Wise Independent Permutations (AZB, MC, AMF, MM), pp. 327–336.
- STOC-1997-NaorR #on the #pseudo #revisited
- On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (MN, OR), pp. 189–199.
- HPCA-1996-QiaoM #multi #network #on the
- On the Multiplexing Degree Required to Embed Permutations in a Class of Networks with Direct Interconnects (CQ, YM), pp. 118–129.
- STOC-1995-HannenhalliP #algorithm #polynomial #sorting
- Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals (SH, PAP), pp. 178–189.
- STOC-1994-MaG #complexity
- The computational complexity of recognizing permutation functions (KM, JvzG), pp. 392–401.
- ICALP-1993-BodlaenderKK #graph
- Treewidth and Pathwidth of Permutation Graphs (HLB, TK, DK), pp. 114–125.
- STOC-1993-AlonCG #graph
- Routing permutations on graphs via matchings (NA, FRKC, RLG), pp. 583–591.
ALP-1992-LaneveM #axiom #equivalence #λ-calculus- Axiomatizing Permutation Equivalence in the λ-Calculus (CL, UM), pp. 350–363.
- DAC-1992-HouC #algorithm
- A Pin Permutation Algorithm for Improving Over-the-Cell Channel Routing (CYH, CYRC), pp. 594–599.
- ICALP-1991-Hagerup #generative #parallel #performance #random
- Fast Parallel Generation of Random Permutations (TH), pp. 405–416.
KR-1991-ChalasaniEM #algorithm #performance #problem- Integrating Efficient Model-Learning and Problem-Solving Algorithms in Permutation Environments (PC, OE, JM), pp. 89–98.
- STOC-1991-BabaiCFLS #algorithm #monte carlo #performance
- Fast Monte Carlo Algorithms for Permutation Groups (LB, GC, LF, EML, ÁS), pp. 90–100.
- STOC-1989-ImpagliazzoR
- Limits on the Provable Consequences of One-Way Permutations (RI, SR), pp. 44–61.
- STOC-1987-BabaiLS
- Permutation Groups in NC (LB, EML, ÁS), pp. 409–420.
- STOC-1986-LubyR #composition #encryption #generative #pseudo
- Pseudo-random Permutation Generators and Cryptographic Composition (ML, CR), pp. 356–363.
- ICALP-1984-RestivoR #formal method
- Cancellation, Pumping and Permutation in Formal Languages (AR, CR), pp. 414–422.
- STOC-1983-DriscollF #on the
- On the Diameter of Permutation Groups (JRD, MLF), pp. 152–160.
- ICALP-1974-Fontet #french #morphism
- Un resultat en theorie des groupes de permutations et son application au calcul effectif du groupe d’automorphismes d’un automate fini (MF), pp. 335–341.
- STOC-1973-Pratt #parallel
- Computing Permutations with Double-Ended Queues, Parallel Stacks and Parallel Queues (VRP), pp. 268–277.
