Stem primit$ (all stems)

151 papers:

PLDI-2015-Appel #encryption #verification

Verification of a cryptographic primitive: SHA-256 (abstract) (AWA), p. 153.

STOC-2015-SunW #canonical #performance

Faster Canonical Forms for Primitive Coherent Configurations: Extended Abstract (XS, JW), pp. 693–702.

LATA-2015-NayakK #on the #word

On the Language of Primitive Partial Words (ACN, KK), pp. 436–445.

DATE-2014-DimitrakopoulosSPTMC #hardware #parallel #synthesis #thread

Hardware primitives for the synthesis of multithreaded elastic systems (GD, IS, AP, KT, PMM, JC), pp. 1–4.

SIGMOD-2014-ArnoldHFSKL #database #set

An application-specific instruction set for accelerating set-oriented database primitives (OA, SH, GF, BS, TK, WL), pp. 767–778.

VLDB-2014-VemuriVPL #execution #scalability

Execution Primitives for Scalable Joins and Aggregations in Map Reduce (SV, MV, KP, RL), pp. 1462–1473.

FoSSaCS-2014-EsparzaD #concurrent #on the

On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations (JE, JD), pp. 258–273.

KEOD-2014-TriantafyllouA #classification

Definition and Classification of Primitives for the Robotic Unfolding of a Piece of Clothing (DT, NAA), pp. 417–422.

QAPL-2014-LatellaLMS #communication

Stochastically timed predicate-based communication primitives for autonomic computing (DL, ML, MM, VS), pp. 1–16.

DRR-2013-ZanibbiMV #graph #pattern matching #pattern recognition #recognition

Evaluating structural pattern recognition for handwritten math via primitive label graphs (RZ, HM, CVG).

ICDAR-2013-YadavCK #using

Most Discriminative Primitive Selection for Identity Determination Using Handwritten Devanagari Script (NY, SC, PKK), pp. 1390–1394.

PODS-2013-AmelootBW #on the #power of

On the expressive power of update primitives (TJA, JVdB, EW), pp. 139–150.

PEPM-2013-DevrieseSCP #domain-specific language #recursion

Fixing idioms: a recursion primitive for applicative DSLs (DD, IS, DC, FP), pp. 97–106.

LATA-2013-Blanchet-SadriBFH #approach #graph #polynomial

A Graph Polynomial Approach to Primitivity (FBS, MB, NF, JH), pp. 153–164.

LATA-2013-GocSS #automation #sequence #word

Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences (DG, KS, JS), pp. 311–322.

ASPLOS-2013-WangW #hardware #named #optimisation #performance

TSO_ATOMICITY: efficient hardware primitive for TSO-preserving region optimizations (CW, YW), pp. 509–520.

DATE-2012-SchrijenL #analysis #comparative

Comparative analysis of SRAM memories used as PUF primitives (GJS, VvdL), pp. 1319–1324.

AFL-J-2011-FazekasLS12 #context-free grammar #on the

On Non-Primitive Palindromic Context-Free Languages (SZF, PL, KST), pp. 1277–1290.

DLT-J-2011-DomaratzkiR12 #word

Abelian Primitive Words (MD, NR), pp. 1021–1034.

DLT-2012-NevisiR #reduction

Morphic Primitivity and Alphabet Reductions (HN, DR), pp. 440–451.

ICPR-2012-ZhangXSS #modelling #process #recognition #representation #smarttech #using

Sparse representation for motion primitive-based human activity modeling and recognition using wearable sensors (MZ, WX, AAS, MS), pp. 1807–1810.

ICST-2012-CalvarTH #framework #monitoring #runtime

A Runtime Monitoring Framework for Event Streams with Non-primitive Arguments (JC, RTL, SH), pp. 499–508.

DATE-2011-TendulkarPNKNK #communication #hardware #runtime

Fine-grain OpenMP runtime support with explicit communication hardware primitives (PT, VP, GN, SGK, DSN, MK), pp. 891–894.

ICDAR-2011-RoyRR #documentation #retrieval #using #word

Word Retrieval in Historical Document Using Character-Primitives (PPR, JYR, NR), pp. 678–682.

DLT-J-2009-KariMS11 #pseudo #word

Properties of Pseudo-Primitive Words and their Applications (LK, BM, SS), pp. 447–471.

AFL-2011-Blanchet-SadriNT #on the #word

On Operations Preserving Primitivity of Partial Words with One Hole (FBS, SN, AT), pp. 93–107.

AFL-2011-FazekasLS

Palindromes and Primitivity (SZF, PL, KST), pp. 184–196.

DLT-2011-DomaratzkiR #word

Abelian Primitive Words (MD, NR), pp. 204–215.

ICALP-v2-2011-BovaCV #comparison

Generic Expression Hardness Results for Primitive Positive Formula Comparison (SB, HC, MV), pp. 344–355.

HIMI-v1-2011-Pavel11a #approach #composition #design #protocol #security

An Approach for Security Protocol Design Based on Zero-Knowledge Primitives Composition (OP), pp. 374–378.

KDD-2011-MueenKY #classification #named

Logical-shapelets: an expressive primitive for time series classification (AM, EJK, NEY), pp. 1154–1162.

HPCA-2011-OuyangNWFP

Beyond block I/O: Rethinking traditional storage primitives (XO, DWN, RW, DF, DKP), pp. 301–311.

LICS-2011-FigueiraFSS #bound #recursion

Ackermannian and Primitive-Recursive Bounds with Dickson’s Lemma (DF, SF, SS, PS), pp. 269–278.

ECSA-2010-KiwelekarJ10a #architecture #communication #concept analysis #identification

Identifying Architectural Connectors through Formal Concept Analysis of Communication Primitives (AWK, RKJ), pp. 515–518.

ESOP-2010-LaneseVF #on the #power of

On the Expressive Power of Primitives for Compensation Handling (IL, CV, CF), pp. 366–386.

LATA-2010-Leupold #context-free grammar #word

Primitive Words Are Unavoidable for Context-Free Languages (PL), pp. 403–413.

ICLP-2010-Wernhard10 #logic programming

Circumscription and Projection as Primitives of Logic Programming (CW), pp. 202–211.

CASE-2009-ArcherSRR #automation #embedded #profiling

Profiling primitives of networked embedded automation (BA, SS, AR, RR), pp. 531–536.

ICDAR-2009-HaboubiMEA #invariant #set

Invariant Primitives for Handwritten Arabic Script: A Contrastive Study of Four Feature Sets (SH, SM, NE, HEA), pp. 691–697.

ICDAR-2009-LiST #identification #independence #online

Hierarchical Shape Primitive Features for Online Text-independent Writer Identification (BL, ZS, TT), pp. 986–990.

DHM-2009-Sugiyama

Harmonic Gait under Primitive DOF for Biped Robot (SS), pp. 150–159.

KDD-2009-YeK #data mining #mining

Time series shapelets: a new primitive for data mining (LY, EJK), pp. 947–956.

PPoPP-2009-HaTA #parallel #programming

Preliminary results on nb-feb, a synchronization primitive for parallel programming (PHH, PT, OJA), pp. 295–296.

PPoPP-2009-NicolauLK #performance

Techniques for efficient placement of synchronization primitives (AN, GL, AK), pp. 199–208.

ECSA-2008-KamalA #behaviour #design pattern #modelling #using

Modeling Architectural Patterns’ Behavior Using Architectural Primitives (AWK, PA), pp. 164–179.

ICALP-B-2008-Jurdzinski #recursion

Leftist Grammars Are Non-primitive Recursive (TJ), pp. 51–62.

ICALP-C-2008-PrzydatekW

Error-Tolerant Combiners for Oblivious Primitives (BP, JW), pp. 461–472.

ICALP-C-2008-ShrimptonS

Building a Collision-Resistant Compression Function from Non-compressing Primitives (TS, MS), pp. 643–654.

AdaEurope-2008-Evequoz #concurrent #performance #using #word

Practical, Fast and Simple Concurrent FIFO Queues Using Single Word Synchronization Primitives (CE), pp. 59–72.

PADL-2008-CasasCH #execution #implementation #independence #strict #towards

Towards a High-Level Implementation of Execution Primitives for Unrestricted, Independent And-Parallelism (AC, MC, MVH), pp. 230–247.

PLDI-2007-LiZ #concurrent #evaluation #implementation #monad #network #scalability #thread

Combining events and threads for scalable network services implementation and evaluation of monadic, application-level concurrency primitives (PL, SZ), pp. 189–199.

POPL-2007-ReppyX #message passing

Specialization of CML message-passing primitives (JHR, YX), pp. 315–326.

SAC-2007-Oriol #component #evolution

Primitives for the dynamic evolution of component-based applications (MO), pp. 1122–1123.

FoSSaCS-2006-Gorla #communication #on the #power of

On the Relative Expressive Power of Asynchronous Communication Primitives (DG), pp. 47–62.

ICPR-v2-2006-MengSCG #modelling #recognition #visual notation

Local Visual Primitives (LVP) for Face Modelling and Recognition (XM, SS, XC, WG), pp. 536–539.

ICPR-v2-2006-XuL #3d #geometry #invariant

3-D Affine Moment Invariants Generated by Geometric Primitives (DX, HL), pp. 544–547.

HPDC-2006-AliL #performance #using

Improving the Performance of Remote I/O Using Asynchronous Primitives (NA, ML), pp. 218–228.

SIGMOD-2005-BrantnerKM #order

Cost-Sensitive Reordering of Navigational Primitives (CCK, MB, GM), pp. 742–753.

VLDB-2005-Galindo-LegariaGKW #database #performance #query

Database Change Notifications: Primitives for Efficient Database Query Result Caching (CAGL, TG, CK, FW), pp. 1275–1278.

OOPSLA-2005-ZdunA #design pattern #modelling #using

Modeling architectural patterns using architectural primitives (UZ, PA), pp. 133–146.

LOPSTR-2005-SuenagaKY #approach #automation #generative #source code #type system

Extension of Type-Based Approach to Generation of Stream-Processing Programs by Automatic Insertion of Buffering Primitives (KS, NK, AY), pp. 98–114.

ASE-2004-MehtaMSA #architecture #behaviour #composition #modelling

Modeling Behavior in Compositions of Software Architectural Primitives (NRM, NM, MS, FA), pp. 371–374.

ICPR-v4-2004-ChanHSP #detection #semantics #using #video

Detecting Rare Events in Video Using Semantic Primitives with HMM (MTC, AH, JS, MP), pp. 150–154.

CSL-2004-AbelM #fixpoint #recursion

Fixed Points of Type Constructors and Primitive Recursion (AA, RM), pp. 190–204.

CSL-2004-Cordon-FrancoFM #induction #recursion

Provably Total Primitive Recursive Functions: Theories with Induction (ACF, AFM, FFLM), pp. 355–369.

FATES-2004-BruckerW #generative #recursion #testing

Symbolic Test Case Generation for Primitive Recursive Functions (ADB, BW), pp. 16–32.

VLDB-2003-ChaudhuriGN #sql #summary

Primitives for Workload Summarization and Implications for SQL (SC, PG, VRN), pp. 730–741.

DLT-2003-FalcoGL #modelling #probability

Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models (DdF, MG, VL), pp. 242–253.

ESEC-FSE-2003-MehtaM #architecture

Composing architectural styles from architectural primitives (NRM, NM), pp. 347–350.

ASIA-PEPM-2002-IwamaK #type system #virtual machine

A new type system for JVM lock primitives (FI, NK), pp. 71–82.

ICALP-2002-Stirling #equivalence #recursion

Deciding DPDA Equivalence Is Primitive Recursive (CS), pp. 821–832.

ICPR-v2-2002-RenX #recognition

Human Action Recognition with Primitive-Based Coupled-HMM (HR, GX), pp. 494–498.

OOPSLA-2002-Pucella #calculus #formal method #towards

Towards a formalization for COM part i: the primitive calculus (RP), pp. 331–342.

PPDP-2002-OstrovskyPT #calculus #higher-order #towards

Towards a primitive higher order calculus of broadcasting systems (KO, KVSP, WT), pp. 2–13.

SAC-2002-TourinoBDG #analysis #clustering #performance

Performance analysis of MPI-I/O primitives on a PC cluster (JT, JB, RD, VMG), pp. 907–912.

FSE-2002-LopesFW #architecture

Architectural primitives for distribution and mobility (AL, JLF, MW), pp. 41–50.

CIKM-2001-SattlerD #classification #database #sql

SQL Database Primitives for Decision Tree Classifiers (KUS, OD), pp. 379–386.

ESOP-2000-WellsV #equation #reasoning

Equational Reasoning for Linking with First-Class Primitive Modules (JBW, RV), pp. 412–428.

ICPR-v2-2000-HontaniD #approximate #generative #multi

Primitive Curve Generation Based on Multiscale Contour Figure Approximation (HH, KD), pp. 2887–2890.

PADL-2000-ChuangM #functional #programming #type system

Out-of-Core Functional Programming with Type-Based Primitives (TRC, SCM), pp. 32–46.

POPL-2000-AbadiFG #authentication #compilation

Authentication Primitives and Their Compilation (MA, CF, GG), pp. 302–315.

SAC-2000-Rowstron #comprehension #optimisation

Optimising the Linda in Primitive: Understanding Tuple-Space Run-times (AITR), pp. 227–232.

SAS-1999-HatcliffCDSZ #concurrent #formal method #multi #slicing #source code #thread #virtual machine

A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives (JH, JCC, MBD, SS, HZ), pp. 1–18.

HCI-EI-1999-LuSUI

A New Method to Synthesize Japanese Sign Language Based on Intuitive Motion Primitives (SL, HS, TU, SI), pp. 441–445.

KDD-1999-ClearDHHLMMRSWX #information management #sql

NonStop SQL/MX Primitives for Knowledge Discovery (JC, DD, BH, MLH, PL, AM, MM, LR, AS, RMW, MX), pp. 425–429.

PPDP-1999-AnconaZ #calculus

A Primitive Calculus for Module Systems (DA, EZ), pp. 62–79.

HPCA-1999-KuoCK #message passing #named

MP-LOCKs: Replacing H/W Synchronization Primitives with Message Passing (CCK, JBC, RK), pp. 284–288.

ESOP-1998-HondaVK #programming

Language Primitives and Type Discipline for Structured Communication-Based Programming (KH, VTV, MK), pp. 122–138.

ICPR-1998-Sluzek #multi #segmentation #using

Multi-level contour segmentation using multiple segmentation primitives (AS), pp. 741–743.

KDD-1998-Subramonian #data mining #mining

Defining diff as a Data Mining Primitive (RS), pp. 334–338.

KR-1998-Muller

A Qualitative Theory of Motion Based on Spatio-Temporal Primitives (PM), pp. 131–143.

CIKM-1997-GoralwallaLOS #modelling

Modeling Temporal Primitives: Back to Basics (IAG, YL, MTÖ, DS), pp. 24–31.

ECOOP-1997-Liquori #first-order

An Extended Theory of Primitive Objects: FIrst Order System (LL), pp. 146–169.

SAC-1997-Bosc #fuzzy #on the

On the primitivity of the division of fuzzy relations (PB), pp. 197–201.

HPCA-1997-QinB #communication #multi #on the #performance

On the Use and Performance of Explicit Communication Primitives in Cache-Coherent Multiprocessor Systems (XQ, JLB), pp. 182–193.

HPDC-1997-BaldoniBP #communication #distributed #flexibility

Flexible General Purpose Communication Primitives for Distributed Systems (RB, RB, RP), pp. 201–210.

PPoPP-1997-Rinard #automation #effectiveness #source code #using

Effective Fine-Grain Synchronization for Automatically Parallelized Programs Using Optimistic Synchronization Primitives (MCR), pp. 112–123.

TLCA-1997-DespeyrouxPS #higher-order #recursion #syntax

Primitive Recursion for Higher-Order Abstract Syntax (JD, FP, CS), pp. 147–163.

ICPR-1996-AguadoMN #fourier #geometry

Extracting arbitrary geometric primitives represented by Fourier descriptors (ASA, EM, MSN), pp. 547–551.

ICPR-1996-GarciaB #image #performance

Fast extraction of surface primitives from range images (MAG, LB), pp. 568–572.

ICPR-1996-JiangM #geometry #using

Geometric primitive extraction using tabu search (TJ, SM), pp. 266–269.

ICPR-1996-StefanoFTV #distance #using

A distance measure for structural descriptions using circular arcs as primitives (CDS, PF, FT, MV), pp. 290–294.

ICPR-1996-VossS #invariant

Invariant fitting of planar objects by primitives (KV, HS), pp. 508–512.

JICSLP-1996-HamfeltN #declarative #logic programming #recursion

Declarative Logic Programming with Primitive Recursive Relations on Lists (AH, JFN), pp. 230–243.

ICDAR-v1-1995-FerayBRP #evaluation #recognition

Evaluation of codes and primitives: recognition of unconstrained handwritten numerals (NF, DdB, KRP, TP), pp. 104–107.

ESOP-J-1994-AbadiC95 #formal method #higher-order

A Theory of Primitive Objects: Second-Order Systems (MA, LC), pp. 81–116.

ICALP-1995-Lipponen #problem #word

Post Correspondence Problem: Words Possible as Primitive Solutions (ML), pp. 63–74.

HPCA-1995-MichaelS #distributed #implementation #memory management #multi

Implementation of Atomic Primitives on Distributed Shared Memory Multiprocessors (MMM, MLS), pp. 222–231.

ESOP-1994-AbadiC #formal method

A Theory of Primitive Objects — Scond-Order Systems (MA, LC), pp. 1–25.

ICALP-1994-Bonizzoni #bound

A Tight Lower Bound for Primitivity in k-Structures (PB), pp. 556–567.

FME-1994-MossesM #action semantics #concurrent #ml #semantics

An Action Semantics for ML Concurrency Primitives (PDM, MM), pp. 461–479.

ICDAR-1993-Chen #segmentation

Primitives segmentation and association for a line character (YSC), pp. 23–26.

POPL-1993-OhoriK #communication #polymorphism #semantics

Semantics for Communication Primitives in an Polymorphic Language (AO, KK), pp. 99–112.

DAC-1992-Malik #multi #network #optimisation #using

Optimization of Primitive Gate Networks Using Multiple Output Two-Level Minimization (AAM), pp. 449–453.

ALP-1992-Hermann #on the #recursion

On the Relation Between Primitive Recursion, Schematization and Divergence (MH), pp. 115–127.

POPL-1992-BerryMT #concurrent #ml #semantics

A Semantics for ML Concurrency Primitives (DB, RM, DNT), pp. 119–129.

WSA-1991-BoeckC #analysis #automation #prolog #type checking

Automatic Construction of Prolog Primitives for Type Checking Analysis (PDB, BLC), pp. 165–172.

ML-1991-Pierce #learning #set

Learning a Set of Primitive Actions with an Uninterpreted Sensorimotor Apparatus (DRP), pp. 338–342.

OOPSLA-1991-SimmelG #data access #semantics #transaction

The Kala Basket: A Semantic Primitive Unifying Object Transactions, Access Control, Versions, and Configurations (SSS, IG), pp. 230–246.

ASPLOS-1991-AppelL #memory management #source code

Virtual Memory Primitives for User Programs (AWA, KL), pp. 96–107.

CSL-1991-Fernando #bisimulation #complexity #logic #recursion #set

A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation (TF), pp. 96–110.

LICS-1991-Mendler #recursion

Predicative Type Universes and Primitive Recursion (NPM), pp. 173–184.

DAC-1990-KundaARN #generative #testing #using

Speed Up of Test Generation Using High-Level Primitives (RPK, JAA, BDR, PN), pp. 594–599.

STOC-1990-Shoup #finite

Searching for Primitive Roots in Finite Fields (VS), pp. 546–554.

ALP-1990-Hofbauer #multi #order #proving #recursion #termination

Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths (DH), pp. 347–358.

SIGMOD-1989-AbiteboulK #query

Object Identity as a Query Language Primitive (SA, PCK), pp. 159–173.

ICALP-1989-Colson #algorithm #recursion

About Primitive Recursive Algorithms (LC), pp. 194–206.

SEKE-1989-FanH #complexity #metric

A Comprehensive Software Complexity Metric for Primitive Modules (ZF, JMH), pp. 67–72.

ASPLOS-1989-AralGS #debugging #multi #performance

Efficient Debugging Primitives for Multiprocessors (ZA, IG, GS), pp. 87–95.

ASPLOS-1989-GoodmanVW #multi #scalability

Efficent Synchronization Primitives for Large-Scale Cache-Coherent Multiprocessors (JRG, MKV, PJW), pp. 64–75.

CSL-1989-Wette #complexity #recursion #representation

Sequential Representation of Primitive Recursive Functions, and Complexity Classes (EW), pp. 422–437.

LICS-1989-Goerdt #complexity #recursion

Characterizing Complexity Classes By Higher Type Primitive Recursive Definitions (AG), pp. 364–374.

JICSCP-1988-Saraswat88 #logic

A Somewhat Logical Formulation of CLP Synchronisation Primitives (VAS), pp. 1298–1314.

SOSP-1987-BirrellGHL #multi #specification

Synchronization Primitives for a Multiprocessor: A Formal Specification (AB, JVG, JJH, RL), pp. 94–102.

ESOP-1986-DahlhausM #programming language

The Choice of Programming Primitives for SETL-Like Programming Languages (ED, JAM), pp. 160–172.

OOPSLA-1986-BallardMW #named

Quicktalk: A Smalltalk-80 Dialect for Defining Primitive Methods (MBB, DM, AWB), pp. 140–150.

ICLP-1986-Moss86 #prolog

Cut and Paste — defining the impure Primitives of Prolog (CM), pp. 686–694.

ICALP-1984-RonRP #csp #hardware #implementation #verification

A Hardware Implementation of the CSP Primitives and its Verification (DR, FR, AP), pp. 423–435.

SLP-1984-Kahn84 #logic programming #source code

A Primitive for the Control of Logic Programs (KMK), pp. 242–251.

STOC-1983-GuibasS #diagrams

Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams (LJG, JS), pp. 221–234.

DAC-1982-CosmaiCMN #2d #interactive

An interactive drafting system based on two dimensional primitives (GC, UC, PM, AN), pp. 521–529.

POPL-1981-Chandra #database #programming

Programming Primitives for Database Languages (AKC), pp. 50–62.

POPL-1980-Kfoury #analysis #set #source code

Analysis of Simple Programs Over Different Sets of Primitives (AJK), pp. 56–61.

SOSP-1979-Liskov #distributed

Primitives for Distributed Computing (BL), pp. 33–42.

POPL-1976-BoyerMS #program transformation #recursion

Primitive Recursive Program Transformations (RSB, JSM, RES), pp. 171–174.

STOC-1974-Lipton #branch

Limitations of Synchronization Primitives with Conditional Branching and Global Variables (RJL), pp. 230–241.

ICALP-1974-Monien #bound #recursion

Characterizations of Time-Bounded Computations by Limited Primitive Recursion (BM), pp. 280–293.

SOSP-1973-Kosaraju #petri net

Limitations of Dijkstra’s Semaphore Primitives and Petri Nets (SRK), pp. 122–136.

ICALP-1972-HenkeIW #automaton #recursion

Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata (FWvH, KI, KW), pp. 549–561.

ICALP-1972-Takahashi #set

Primitive Tranformations of Regular Sets and Recognizable Sets (MT), pp. 475–480.

STOC-1971-Machtey #classification #recursion

Classification of Computable Functions by Primitive Recursive Classes (MM), pp. 251–257.