65 papers:
CASE-2015-LiangSQLY #agile #assessment #development #using- Criteria for lean practice selection: Development an assessment tool using the rooted arborescence (YL, SS, LQ, YL, GY), pp. 237–242.
HIMI-IKC-2015-WangN #analysis #identification #matrix- Dot Matrix Analysis of Plant Operation Data for Identifying Sequential Alarms Triggered by Single Root Cause (ZW, MN), pp. 152–158.
QAPL-2015-LeeV #bisimulation #branch #congruence #probability- Rooted branching bisimulation as a congruence for probabilistic transition systems (MDL, EPdV), pp. 79–94.
ICSE-v2-2015-KazmanCMFXHFS #architecture #case study #technical debt- A Case Study in Locating the Architectural Roots of Technical Debt (RK, YC, RM, QF, LX, SH, VF, AS), pp. 179–188.
SOSP-2015-KasikciSPPC #automation #sketching- Failure sketching: a technique for automated root cause diagnosis of in-production failures (BK, BS, CP, GP, GC), pp. 344–360.
ASE-2014-Schneider #fault #modelling- Tracking down root causes of defects in simulink models (JS), pp. 599–604.
- ASE-2014-Schneider14a #fault #modelling #runtime
- Determining the most probable root causes of run-time errors in simulink models (JS), pp. 875–878.
STOC-2014-Lovett #bound #communication #rank- Communication is bounded by root of rank (SL), pp. 842–846.
MLDM-2014-BugaychenkoZ #diagrams #learning #multi #pattern matching #pattern recognition #performance #recognition #using- Fast Pattern Recognition and Deep Learning Using Multi-Rooted Binary Decision Diagrams (DB, DZ), pp. 73–77.
PPDP-2014-Neron- Elimination of Square Roots and Divisions by Partial Inlining (PN), pp. 81–92.
FSE-2014-Xiao #architecture #debugging #detection- Detecting and preventing the architectural roots of bugs (LX), pp. 811–813.
WCRE-2013-ThungLJ #automation- Automatic recovery of root causes from bug-fixing changes (FT, DL, LJ), pp. 92–101.
ICALP-v2-2013-Marx #graph- The Square Root Phenomenon in Planar Graphs (DM), p. 28.
- SOSP-2013-WeissHAA #game studies #named #parallel #thread
- ROOT: replaying multithreaded traces with resource-oriented ordering (ZW, TH, ACAD, RHAD), pp. 373–387.
CIAA-2012-Ceccherini-SilbersteinCFS #automaton- Cellular Automata on Regular Rooted Trees (TCS, MC, FF, ZS), pp. 101–112.
CSCW-2012-PaoMCR #approach #collaboration #design- A need-driven design approach: addressing latent needs in collaboration rooted in early childhood (SYP, SM, KC, AR), pp. 829–832.
CAiSE-2012-ZawawyKMM #analysis #logic #markov #network #using- Requirements-Driven Root Cause Analysis Using Markov Logic Networks (HZ, KK, JM, SM), pp. 350–365.
CIKM-2012-KurlandSHRCR #framework #predict #probability- Back to the roots: a probabilistic framework for query-performance prediction (OK, AS, SH, FR, DC, OR), pp. 823–832.
SIGIR-2012-Kantor #research- A new look at old tricks: the fertile roots of current research (PBK), p. 1183.
OSDI-2012-AttariyanCF #automation #named #performance- X-ray: Automating Root-Cause Diagnosis of Performance Anomalies in Production Software (MA, MC, JF), pp. 307–320.
VMCAI-2012-Bugaychenko #diagrams #model checking #multi #on the #probability- On Application of Multi-Rooted Binary Decision Diagrams to Probabilistic Model Checking (DB), pp. 104–118.
- STOC-2011-PatrascuT11a
- Don’t rush into a union: take time to find your roots (MP, MT), pp. 559–568.
ECIR-2011-ZucconAR #analysis- Back to the Roots: Mean-Variance Analysis of Relevance Estimations (GZ, LA, KvR), pp. 716–720.
- SIGIR-2011-Kantor #research
- A new look at old tricks: the fertile roots of current research (PBK), pp. 1297–1298.
SAC-2011-MagalhaesS #analysis #performance- Root-cause analysis of performance anomalies in web-based applications (JPM, LMS), pp. 209–216.
ICSM-2010-ZawawyKM #analysis- Log filtering and interpretation for root cause analysis (HZ, KK, JM), pp. 1–5.
- ICALP-v1-2010-Litow #on the
- On Sums of Roots of Unity (BEL), pp. 420–425.
ECOOP-2010-Lea- Code Roots (DL), p. 1.
DAC-2009-KamhiNTW #analysis #architecture #named #statistics #transaction- MAGENTA: transaction-based statistical micro-architectural root-cause analysis (GK, AN, AT, AW), pp. 639–643.
- ICALP-v1-2009-BansalCPK #bound #scalability
- Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule (NB, HLC, KP, DK), pp. 144–155.
KEOD-2009-Haddad #approach #probability #representation #towards #word- Representation of Arabic Words — An Approach Towards Probabilistic Root-Pattern Relationships (BH), pp. 147–152.
- SAC-2009-FarberB #composition #multi
- Multivariate root finding with search space decomposition and randomisation (MF, BB), pp. 1142–1143.
- ICSM-2008-JeffreyGG #debugging #identification #memory management #using
- Identifying the root causes of memory bugs using corrupted memory location suppression (DJ, NG, RG), pp. 356–365.
- ICSM-2008-Zhu #analysis #fault
- Goal trees and fault trees for root cause analysis (QZ), pp. 436–439.
KDD-2008-BifetG #adaptation #data type #mining- Mining adaptively frequent closed unlabeled rooted trees in data streams (AB, RG), pp. 34–42.
RTA-2008-SternagelM- Root-Labeling (CS, AM), pp. 336–350.
DATE-2007-KhanATE #algorithm #implementation #pipes and filters #sorting- A new pipelined implementation for minimum norm sorting used in square root algorithm for MIMO-VBLAST systems (ZK, TA, JST, ATE), pp. 1569–1574.
- WCRE-2007-Zhu #framework #research
- An Experimental Platform for Root Cause Diagnosis Research (QZ), pp. 293–296.
DLT-2007-Leupold- Duplication Roots (PL), pp. 290–299.
- HIMI-IIE-2007-Quraishy #case study #design #health #how #implementation #information management
- How Participation at Different Hierarchical Levels Can Have an Impact on the Design and Implementation of Health Information Systems at the Grass Root Level — A Case Study from India (ZBQ), pp. 128–136.
ICML-2007-WachmanK #kernel #learning #order- Learning from interpretations: a rooted kernel for ordered hypergraphs (GW, RK), pp. 943–950.
ISMM-2007-Joisha #framework #garbage collection #performance- Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast (PGJ), pp. 141–158.
ICPR-v2-2006-RobertsMHVB #estimation #multi #network- Part-Based Multi-Frame Registration for Estimation of the Growth Of Cellular Networks in Plant Roots (TJR, SJM, JH, TAV, AGB), pp. 378–381.
- ICPR-v3-2006-AsanoTTTANTHM #using
- Extraction of trabecular structures of mandible excluding tooth roots on dental panoramic radiographs using mathematical morphology (AA, TT, AT, CMA, TN, KT, TH, MM), pp. 988–991.
HPDC-2006-BellenotBGIKPRBLRCF #named #parallel #proving- PROOF — The Parallel ROOT Facility (BB, RB, GG, JI, GK, AJP, FR, MB, CL, CR, PC, DF), pp. 379–380.
- ICALP-2005-GuptaP #probability
- Stochastic Steiner Trees Without a Root (AG, MP), pp. 1051–1063.
TACAS-2004-BeauquierCP #automation #first-order #logic #parametricity #protocol #state machine #verification- Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic (DB, TC, EP), pp. 372–387.
ICEIS-v3-2004-Nobre #complexity #design #learning- Organisational Learning — Foundational Roots for Design for Complexity (ÂLN), pp. 85–93.
- SIGIR-2004-KimSR #approach #information retrieval #using #word
- Information retrieval using word senses: root sense tagging approach (SBK, HCS, HCR), pp. 258–265.
- DLT-2002-HorvathLL #regular expression
- Roots and Powers of Regular Languages (SH, PL, GL), pp. 220–230.
- DLT-2001-Lischke #complexity
- The Root of a Language and Its Complexity (GL), pp. 272–280.
CC-2001-Siebert #garbage collection- Constant-Time Root Scanning for Deterministic Garbage Collection (FS), pp. 304–318.
- ICPR-v2-2000-Haindl #recursion
- Recursive Square-Root Filters (MH), pp. 6014–6017.
- ICSE-2000-LeszakPS #analysis #case study #fault
- A case study in root cause defect analysis (ML, DEP, DS), pp. 428–437.
- SAC-1999-RousanA
- Computation of Square Root of X (NR, HAS), pp. 74–77.
ICRE-1998-RobinsonP #documentation #interactive #requirements- Surfacing Root Requirements Interactions from Inquiry Cycle Requirements Documents (WNR, SDP), pp. 82–89.
- TACAS-1997-ParashkevovY #analysis #performance #pseudo #reachability
- Space Efficient Reachability Analysis Through Use of Pseudo-Root States (ANP, JY), pp. 50–64.
- HCI-SEC-1997-PedraliB #analysis #process #question
- Can We Trace Back Cognitive Processes in Root Cause Analysis? (MP, RB), pp. 59–62.
POPL-1997-Middeldorp #call-by- Call by Need Computations to Root-Stable Form (AM), pp. 94–105.
- IWMM-1992-Chailloux #ambiguity #garbage collection #static typing
- A Conservative Garbage Collector with Ambiguous Roots for Static Typechecking Languages (EC), pp. 218–229.
- STOC-1990-Shoup #finite
- Searching for Primitive Roots in Finite Fields (VS), pp. 546–554.
GG-1990-Lichtblau #polynomial- Recognizing Rooted Context-free Flowgraph Languages in Polynomial Time (UL), pp. 538–548.
- STOC-1986-Ben-OrFKT #algorithm #parallel #performance #polynomial
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots (MBO, EF, DK, PT), pp. 340–349.
- STOC-1985-Huang #finite
- Riemann Hypothesis and Finding Roots over Finite Fields (MDAH), pp. 121–130.
- ICALP-1984-Vitanyi #realtime
- The Simple Roots of Real-Time Computation Hierarchies (Preliminary Version) (PMBV), pp. 486–489.
