Stem left$ (all stems)

66 papers:

SIGMOD-2015-Atre #query

Left Bit Right: For SPARQL Join Queries with OPTIONAL Patterns (Left-outer-joins) (MA), pp. 1793–1808.

DUXU-UI-2015-BeltranUPSSSPCA #design #game studies #learning

Inclusive Gaming Creation by Design in Formal Learning Environments: “Girly-Girls” User Group in No One Left Behind (MEB, YU, AP, CS, WS, BS, SdlRP, MFCU, MTA), pp. 153–161.

CADE-2015-ShintaniH #confluence #linear #named #term rewriting

CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems (KS, NH), pp. 127–136.

CIAA-2014-KoH #nondeterminism

Left is Better than Right for Reducing Nondeterminism of NFAs (SKK, YSH), pp. 238–251.

DLT-2014-BrzozowskiS #bound #complexity

Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals (JAB, MS), pp. 13–24.

DUXU-DI-2014-AsciR #case study #comparative #mobile #user interface

Left vs. Right-Handed UX: A Comparative User Study on a Mobile Application with Left and Right-Handed Users (SA, KR), pp. 173–183.

ICPR-2014-LinCCLH #analysis #detection

Left-Luggage Detection from Finite-State-Machine Analysis in Static-Camera Videos (KL, SCC, CSC, DTL, YPH), pp. 4600–4605.

ICPR-2014-YamadaM #approach #behaviour #using

Estimating Driver Awareness of Crossing Pedestrians While Turning Left Based on Vehicle Behavior Using Bayesian Approach (KY, TM), pp. 1898–1903.

FSE-2014-BaysalHG #information management #issue tracking

No issue left behind: reducing information overload in issue tracking (OB, RH, MWG), pp. 666–677.

PEPM-2013-CominiT #automation #equivalence #linear #named #term rewriting

TRSynth: a tool for automatic inference of term equivalence in left-linear term rewriting systems (MC, LT), pp. 67–70.

CHI-2013-AnnettB #exclamation #gesture #symmetry

Your left hand can do it too!: investigating intermanual, symmetric gesture transfer on touchscreens (MA, WFB), pp. 1119–1128.

CSCW-2013-PanTLZLFDW

An exploration on long-distance communications between left-behind children and their parents in China (LP, FT, FL, X(Z, YL, WF, GD, HW), pp. 1147–1156.

PPDP-2012-Thielecke #continuation #functional #parsing #recursion #semantics

Functional semantics of parsing actions, and left recursion elimination as continuation passing (HT), pp. 91–102.

HCI-MIIE-2011-NakamuraN

Beginner Driver Support System for Merging into Left Main Lane (YN, YN), pp. 444–451.

CIKM-2011-GyllstromM #category theory #wiki

Examining the “leftness” property of Wikipedia categories (KG, MFM), pp. 2309–2312.

ICML-2011-AroraGKF #clustering #matrix

Clustering by Left-Stochastic Matrix Factorization (RA, MRG, AK, MF), pp. 761–768.

RTA-2011-DurandS #bound #linear

Left-linear Bounded TRSs are Inverse Recognizability Preserving (ID, MS), pp. 361–376.

LDTA-2009-BaarsSV10

Typed Transformations of Typed Grammars: The Left Corner Transform (AIB, SDS, MV), pp. 51–64.

DAC-2009-BonnyH #named #performance

LICT: left-uncompressed instructions compression technique to improve the decoding performance of VLIW processors (TB, JH), pp. 903–906.

DLT-2009-Carton

Left and Right Synchronous Relations (OC), pp. 170–182.

HCI-NIMT-2009-WhangWK #research

The Research on EEG Coherence Around Central Area of Left Hemisphere According to Grab Movement of Right Hand (MCW, JW, JK), pp. 636–642.

PEPM-2008-WarthDM #parsing #recursion

Packrat parsers can support left recursion (AW, JRD, TDM), pp. 103–110.

FLOPS-2008-Vidal #linear #termination

Termination of Narrowing in Left-Linear Constructor Systems (GV), pp. 113–129.

PADL-2008-FrostHC #ambiguity #combinator #parsing #recursion

Parser Combinators for Ambiguous Left-Recursive Grammars (RAF, RH, PC), pp. 167–181.

POPL-2008-McBride #data type

Clowns to the left of me, jokers to the right (pearl): dissecting data structures (CM), pp. 287–295.

ISMM-2008-SartorHM

No bit left behind: the limits of heap data compression (JBS, MH, KSM), pp. 111–120.

ICALP-v2-2006-AcetoFIL #communication #equation #finite

A Finite Equational Base for CCS with Left Merge and Communication Merge (LA, WF, AI, BL), pp. 492–503.

ICPR-v4-2006-WangJ #image #segmentation

Segmentation of the Left Ventricle from Cardiac MR Images Based on Degenerated Minimal Surface Diffusion and Shape Priors (YW, YJ), pp. 671–674.

RTA-2006-GramlichL #linear #term rewriting

Generalizing Newman’s Lemma for Left-Linear Rewrite Systems (BG, SL), pp. 66–80.

RTA-2006-WangS #decidability #linear #termination

Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems (YW, MS), pp. 343–356.

ITiCSE-2005-BiancoT #process #question #why

Why are children left out of the CS rethinking process? (GMB, ST), p. 352.

CHI-2005-MarkGH

No task left behind?: examining the nature of fragmented work (GM, VMG, JH), pp. 321–330.

RTA-2005-GeserHWZ #automaton #linear #on the #term rewriting #termination

On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems (AG, DH, JW, HZ), pp. 353–367.

ITiCSE-WGR-2004-CanningMRR #c #using

Reading types in C using the right left walk method (JC, WM, AR, DR), pp. 52–54.

DLT-2004-JurdzinskiOMP04a #automaton #on the

On Left-Monotone Deterministic Restarting Automata (TJ, FO, FM, MP), pp. 249–260.

LDTA-2004-LohmannRS #attribute grammar #migration #recursion #semantics

Semantics-preserving Migration of Semantic Rules During Left Recursion Removal in Attribute Grammars (WL, GR, MS), pp. 133–148.

DocEng-2003-Vion-Dury #towards #xml #xpath

XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns (JYVD), pp. 19–25.

CIAA-2002-Trahtman #algorithm #polynomial #testing

A Polynomial Time Algorithm for Left [Right] Local Testability (ANT), pp. 203–212.

DLT-2001-Choffrut

Elementary Theory of Ordinals with Addition and Left Translation by ω (CC), pp. 15–20.

WLC-2000-Saito

Acts over Right, Left Regular Bands and Semilattices Types (TS), pp. 396–402.

WLC-2000-ShumSG

Subdirect Product Structure of Left Clifford Semigroups (KPS, MKS, YQG), pp. 428–433.

ICPR-v4-2000-OhyamaWKTS #automation #detection

Automatic Left Ventricular Endocardium Detection in Echocardiograms Based on Ternary Thresholding Method (WO, TW, FK, ST, KS), pp. 4320–4323.

DLT-1999-RuizG

Right and left strongly locally testable semigroups and languages (JR, PG), pp. 232–241.

LOPSTR-1999-BossiCE #source code

Transformation of Left Terminating Programs (AB, NC, SE), pp. 156–175.

RTA-1999-NagayaT #decidability #term rewriting

Decidability for Left-Linaer Growing Term Rewriting Systems (TN, YT), pp. 256–270.

ALP-1997-CesarM #linear

A Left-Linear Variant of λσ (AC, HM), pp. 224–239.

ALP-1997-NedjahWE #automaton #pattern matching

Optimal Left-to-Right Pattern-Matching Automata (NN, CDW, SEE), pp. 273–286.

ICLP-1997-DecorteS #analysis #automation #constraints #logic programming #source code

Demand-Driven and Constraint-Based Automatic Left-Termination Analysis for Logic Programs (SD, DDS), pp. 78–92.

RTA-1997-OyamaguchiO #linear #parallel #term rewriting

A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems (MO, YO), pp. 187–201.

JICSLP-1996-Mesnard #constraints #logic programming #query #source code

Inferring Left-terminating Classes of Queries for Constraint Logic Programs (FM), pp. 7–21.

LOPSTR-1995-BossiCE #order #problem #source code

Transformation of Left Terminating Programs: the Reordering Problem (AB, NC, SE), pp. 33–45.

PLILP-1993-Nederhof #algorithm #definite clause grammar #parsing #recursion #top-down

A New Top-Down Parsing Algorithm for Left-Recursive DCGs (MJN), pp. 108–122.

LICS-1992-Toyama #linear #term rewriting

Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems (YT), pp. 274–284.

SIGMOD-1991-IoannidisK #analysis #optimisation #query

Left-Deep vs. Bushy Trees: An Analysis of Strategy Spaces and its Implications for Query Optimization (YEI, YCK), pp. 168–177.

RTA-1991-Graf #pattern matching

Left-to-Right Tree Pattern Matching (AG), pp. 323–334.

VLDB-1990-KempRS #information management #maintenance #multi

Right-, left- and multi-linear rule transformations that maintain context information (DBK, KR, ZS), pp. 380–391.

ICALP-1990-Moller #algebra #process

The Importance of the Left Merge Operator in Process Algebras (FM), pp. 752–764.

SIGMOD-1989-NaughtonRSU #evaluation #performance

Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules (JFN, RR, YS, JDU), pp. 235–242.

RTA-1989-Dauchet #linear #simulation #turing machine

Simulation of Turing Machines by a Left-Linear Rewrite Rule (MD), pp. 109–120.

RTA-1989-ToyamaKB #linear #term rewriting #termination

Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft- (YT, JWK, HPB), pp. 477–491.

ALP-1988-FulopV #automaton #linear #set #term rewriting

A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata (ZF, SV), p. 157.

LICS-1987-BohmT #λ-calculus

X-Separability and Left-Invertibility in λ-calculus (CB, ET), pp. 320–328.

ICALP-1979-Nijholt #recursion

Structure Preserving Transformations on Non-Left-Recursive Grammars (Preliminary Version) (AN), pp. 446–459.

ICALP-1977-KriegelO

Left-Fitting Translations (HPK, TO), pp. 309–322.

POPL-1977-Demers #parsing

Generalized Left Corner Parsing (AJD), pp. 170–182.

POPL-1977-Nijholt #on the #recursion

On the Covering of Left Recursive Grammars (AN), pp. 86–96.