19 papers:
ICPC-2015-SaiedABS #api #library #question #source code #using- Could we infer unordered API usage patterns only using the library source code? (MAS, HA, OB, HAS), pp. 71–81.
LATA-2015-BoiretHNT #constraints #logic- Logics for Unordered Trees with Data Constraints on Siblings (AB, VH, JN, RT), pp. 175–187.
- LATA-2012-Hovland #constraints #problem #regular expression
- The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints (DH), pp. 313–324.
ICPR-2012-SvarmSEO #image #using- Point track creation in unordered image collections using Gomory-Hu trees (LS, ZS, OE, CO), pp. 2116–2119.
PPoPP-2011-HassaanBP #algorithm #comparison #order #parallel- Ordered vs. unordered: a comparison of parallelism and work-efficiency in irregular algorithms (MAH, MB, KP), pp. 3–12.
DATE-2010-AgyekumN #communication #hardware #robust- An error-correcting unordered code and hardware support for robust asynchronous global communication (MYA, SMN), pp. 765–770.
ICML-2010-HueV #kernel #learning #on the- On learning with kernels for unordered pairs (MH, JPV), pp. 463–470.
- ICPR-2010-GordoP #approach #classification #documentation #multi
- A Bag-of-Pages Approach to Unordered Multi-page Document Classification (AG, FP), pp. 1920–1923.
HPCA-2009-AgarwalPJ- In-Network Snoop Ordering (INSO): Snoopy coherence on unordered interconnects (NA, LSP, NKJ), pp. 67–78.
DLT-2007-Priese #automaton #finite #graph- Finite Automata on Unranked and Unordered DAGs (LP), pp. 346–360.
- DLT-J-2005-FukagawaA06 #algorithm #comparison #performance
- Fast Algorithms for Comparison of Similar Unordered Trees (DF, TA), pp. 703–729.
CIKM-2005-LeonardiB #approach #database #detection #documentation #relational #using #xml- Detecting changes on unordered XML documents using relational databases: a schema-conscious approach (EL, SSB), pp. 509–516.
KDD-2005-UkkonenFM #partial order- Finding partial orders from unordered 0-1 data (AU, MF, HM), pp. 285–293.
RTA-2005-BonevaT #automaton #logic- Automata and Logics for Unranked and Unordered Trees (IB, JMT), pp. 500–515.
- CIKM-2004-ZhaoBMK #xml
- Discovering frequently changing structures from historical structural deltas of unordered XML (QZ, SSB, MKM, YK), pp. 188–197.
SAC-2003-HuangC #generative #query #replication- Broadcast Program Generation for Unordered Queries with Data Replication (JLH, MSC), pp. 866–870.
- SAC-2000-BusiZ #coordination #data-driven #order
- Event Notification in Data-driven Coordination Languages: Comparing the Ordered and Unordered Interpretations (NB, GZ), pp. 233–239.
- DLT-1995-Satta #problem
- The Membership Problem for Unordered Vector Languages (GS), pp. 267–275.
- SAC-1994-WooR #algorithm #parallel
- Unordered parallel distance-1 and distance-2 FFT algorithms of radix 2 and (4-2) (MlW, RAR), pp. 504–509.
