36 papers:
SIGMOD-2015-CochezM #approximate #clustering #distance #linear- Twister Tries: Approximate Hierarchical Agglomerative Clustering for Average Distance in Linear Time (MC, HM), pp. 505–517.
OOPSLA-2015-SteindorferV #agile #optimisation #performance #virtual machine- Optimizing hash-array mapped tries for fast and lean immutable JVM collections (MJS, JJV), pp. 783–800.
SAC-2015-BrideJM #approximate #generative #testing- Tri-modal under-approximation of event systems for test generation (HB, JJ, PAM), pp. 1737–1744.
DocEng-2014-DavisonMM #named #privacy #semantics #similarity- P-GTM: privacy-preserving google tri-gram method for semantic text similarity (OD, AM, EEM), pp. 81–84.
SIGMOD-2014-GurajadaSMT #distributed #message passing #named #rdf- TriAD: a distributed shared-nothing RDF engine based on asynchronous message passing (SG, SS, IM, MT), pp. 289–300.
CHI-2014-ShayIRC #case study #experience #quote #why- “My religious aunt asked why i was trying to sell her viagra”: experiences with account hijacking (RS, II, RWR, SC), pp. 2657–2666.
GPCE-2014-SteindorferV #memory management #performance- Code specialization for memory efficient hash tries (short paper) (MJS, JJV), pp. 11–14.
PADL-2014-AreiasR #correctness #logic programming #on the #performance #source code- On the Correctness and Efficiency of Lock-Free Expandable Tries for Tabled Logic Programs (MA, RR), pp. 168–183.
ISMM-2014-Joisha #performance #scalability- Sticky tries: fast insertions, fast lookups, no deletions for large key universes (PGJ), pp. 35–46.
ICDAR-2013-MauroEF #web- Finding Critical Cells in Web Tables with SRL: Trying to Uncover the Devil’s Tease (NDM, FE, SF), pp. 882–886.
CHI-2013-GilbertBCT #bibliography #statistics- “I need to try this”?: a statistical overview of pinterest (EG, SB, SC, LGT), pp. 2427–2436.
ICPR-2012-LingZP #ranking #retrieval #similarity- Tri-space and ranking based heterogeneous similarity measure for cross-media retrieval (LL, XZ, YP), pp. 230–233.
KDD-2012-ZhangY #bound #community #detection #matrix- Overlapping community detection via bounded nonnegative matrix tri-factorization (YZ, DYY), pp. 606–614.
PPoPP-2012-ProkopecBBO #concurrent #performance- Concurrent tries with efficient non-blocking snapshots (AP, NGB, PB, MO), pp. 151–160.
ITiCSE-2011-Impagliazzo- Try a little history (JI), p. 332.
FoSSaCS-2011-BorealePP #information management- Asymptotic Information Leakage under One-Try Attacks (MB, FP, MP), pp. 396–410.
CIKM-2011-WangHD #clustering #matrix #multi #relational #symmetry- Simultaneous clustering of multi-type relational data via symmetric nonnegative matrix tri-factorization (HW, HH, CHQD), pp. 279–284.
SIGIR-2011-WangHND #classification #information management #matrix #using #web- Cross-language web page classification via dual knowledge transfer using nonnegative matrix tri-factorization (HW, HH, FN, CHQD), pp. 933–942.
CHI-2010-CramerESGW #mobile #social #trust- Trying too hard: effects of mobile agents’ (Inappropriate) social expressiveness on trust, affect and compliance (HSMC, VE, TvS, MG, BJW), pp. 1471–1474.
ICPR-2010-XueJ #3d #recognition- A New Rotation Feature for Single Tri-axial Accelerometer Based 3D Spatial Handwritten Digit Recognition (YX, LJ), pp. 4218–4221.
KDIR-2010-TsengPF #classification #markov #using- The Typhoon Track Classification using Tri-plots and Markov Chain (JCHT, HKKP, CF), pp. 364–369.
SAC-2010-RibeiroS #data type #named #network #performance- g-tries: an efficient data structure for discovering network motifs (PMPR, FMAS), pp. 1559–1566.
KEOD-2009-MatusiewiczMR #logic- Reduced Implicate Tries and Logical Operations (AM, NVM, ER), pp. 456–459.
ICPR-2008-QuQY #learning- Learning a discriminative sparse tri-value transform (ZQ, GQ, PCY), pp. 1–4.
HCI-IPT-2007-LuS #artificial reality #e-commerce- Augmented Reality E-Commerce Assistant System: Trying While Shopping (YL, SS), pp. 643–652.
ICPR-v4-2006-KarthikJ #image #performance #retrieval- Efficient Region Based Indexing and Retrieval for Images with Elastic Bucket Tries (PSK, CVJ), pp. 169–172.
ICDAR-2005-LamH #data type #performance #using- A Data Structure Using Hashing and Tries For Efficient Chinese Lexical Access (YKL, QH), pp. 506–510.
SIGMOD-2005-ZhaoZ #3d #algorithm #array #clustering #effectiveness #mining #named- TriCluster: An Effective Algorithm for Mining Coherent Clusters in 3D Microarray Data (LZ, MJZ), pp. 694–705.
ICPR-v4-2004-ZhangS #difference #metric- Discovery of the Tri-Edge Inequality with Binary Vector Dissimilarity Measures (BZ, SNS), pp. 669–672.
TACAS-2003-Lee #case study #experience #what- What Are We Trying to Prove? Reflections on Experiences with Proof-Carrying Code (PL0), p. 1.
ICEIS-v1-2003-LocMP #approach #component #trust- Try and Patch: An Approach to Improve the Trust in Software Components (PTXL, PM, GP), pp. 505–508.
TestCom-2002-SchulzV #implementation #using- Implementation of TTCN-3 Test Systems using the TRI (SS, TVG), pp. 425–442.
KDD-2001-TrainaTPF #data mining #mining #multi #named #scalability #tool support- Tri-plots: scalable tools for multidimensional data mining (AJMT, CTJ, SP, CF), pp. 184–193.
SAC-1998-KappelRR #architecture #database #implementation- A tour on the TriGS active database system — architectue and implementation (GK, SRS, WR), pp. 211–219.
ICDAR-v1-1995-LiangLY #query- False hits of tri-syllabic queries in a Chinese signature file (TL, SYL, WPY), pp. 159–162.
DAC-1983-OgiharaMTKF #bidirectional #design #generative #testing- Test generation for scan design circuits with tri-state modules and bidirectional terminals (TO, SM, YT, KK, HF), pp. 71–78.