## Stem intersect$ (all stems)

### 139 papers:

- ICALP-v2-2015-SwernofskyW #complexity #on the
- On the Complexity of Intersecting Regular, Context-Free, and Tree Languages (JS, MW), pp. 414–426.
- ICFP-2015-KeilT #contract #higher-order
- Blame assignment for higher-order contracts with intersection and union (MK, PT), pp. 375–386.
- HIMI-IKC-2015-KosakaN #behaviour #education
- Education Method for Safe Bicycle Riding to Evaluate Actual Cycling Behaviors When Entering an Intersection (HK, MN), pp. 225–232.
- ICML-2015-GeZ #matrix
- Intersecting Faces: Non-negative Matrix Factorization With New Guarantees (RG, JZ), pp. 2295–2303.
- TLCA-2015-BessaiDDCdR #composition #mixin #synthesis
- Mixin Composition Synthesis Based on Intersection Types (JB, AD, BD, TCC, Ud, JR), pp. 76–91.
- PODS-2014-PaghSW #question #set
- Is min-wise hashing optimal for summarizing set intersection? (RP, MS, DPW), pp. 109–120.
- VLDB-2015-InoueOT14 #branch #performance #predict #set
- Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions (HI, MO, KT), pp. 293–304.
- STOC-2014-Kane
- The average sensitivity of an intersection of half spaces (DMK), pp. 437–440.
- DLT-J-2013-BertoniCD14 #automaton #context-free grammar #decidability #on the #problem #quantum
- On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages (AB, CC, FD), pp. 1065–1082.
- ICALP-v2-2014-Wehar
- Hardness Results for Intersection Non-Emptiness (MW), pp. 354–362.
- SIGIR-2014-KaneT
- Skewed partial bitvectors for list intersection (AK, FWT), pp. 263–272.
- BX-2014-BrownlowP #integration
- Intersection Schemas as a Dataspace Integration Technique (RB, AP), pp. 92–99.
- PPDP-2014-Ramsay #abstraction #recursion #safety
- Exact Intersection Type Abstractions for Safety Checking of Recursion Schemes (SJR), pp. 175–186.
- RTA-TLCA-2014-Dezani-CiancagliniG #precise #type system
- Preciseness of Subtyping on Intersection and Union Types (MDC, SG), pp. 194–207.
- DLT-2013-Pin #regular expression
- An Explicit Formula for the Intersection of Two Polynomials of Regular Languages (JÉP), pp. 31–45.
- ICALP-v2-2013-SpirakisNR #graph #random
- A Guided Tour in Random Intersection Graphs (PGS, SEN, CR), pp. 29–35.
- DHM-SET-2013-MoriK #3d #evaluation #simulation
- Ergonomics Study of Direct and Indirect Visibility Evaluation at Uncontrolled Intersections Based on Three-Dimensional Computer Simulation (MM, NK), pp. 70–77.
- HCI-UC-2013-KuramochiOTHN #analysis #community #graph #network #semantics #twitter #using
- Applying to Twitter Networks of a Community Extraction Method Using Intersection Graph and Semantic Analysis (TK, NO, KT, YH, SN), pp. 314–323.
- HIMI-HSM-2013-KosakaN #behaviour #education
- Pilot Experiments in Education for Safe Bicycle Riding to Evaluate Actual Cycling Behaviors When Entering an Intersection (HK, MN), pp. 515–523.
- HIMI-HSM-2013-SuzukiMKY #behaviour
- Human Behavior of Prioritizing Right-Turning Vehicles and Traffic Flow at Intersections (HS, YM, TK, YY), pp. 558–567.
- ICML-c3-2013-RichardBV #estimation #multi
- Intersecting singularities for multi-structured estimation (ER, FRB, JPV), pp. 1157–1165.
- SIGIR-2013-TakumaY #bound #performance
- Faster upper bounding of intersection sizes (DT, HY), pp. 703–712.
- CSL-2013-GianantonioL #game studies #semantics
- Innocent Game Semantics via Intersection Type Assignment Systems (PDG, ML), pp. 231–247.
- TLCA-2013-DudderMR #type system
- Intersection Type Matching with Subtyping (BD, MM, JR), pp. 125–139.
- VMCAI-2013-Pearce #type system
- Sound and Complete Flow Typing with Unions, Intersections and Negations (DJP), pp. 335–354.
- ITiCSE-2012-HeinesGR #music
- Techniques at the intersection of computing and music (JMH, GRG, SAR), p. 372.
- ICALP-v2-2012-OngT #game studies #recursion #semantics
- Two-Level Game Semantics, Intersection Types, and Recursion Schemes (CHLO, TT), pp. 325–336.
- LATA-2012-Noual
- Dynamics of Circuits and Intersecting Circuits (MN), pp. 433–444.
- ICFP-2012-Dunfield
- Elaborating intersection and union types (JD), pp. 17–28.
- CIKM-2012-AsadiL #documentation #generative #performance #ranking
- Fast candidate generation for two-phase document ranking: postings list intersection with bloom filters (NA, JL), pp. 2419–2422.
- ICML-2012-YuSL12a #performance
- Efficient Euclidean Projections onto the Intersection of Norm Balls (AWY, HS, FFL), p. 203.
- ICPR-2012-FreytagFRD #kernel #performance #process #segmentation #semantics
- Efficient semantic segmentation with Gaussian processes and histogram intersection kernels (AF, BF, ER, JD), pp. 3313–3316.
- SAC-2012-Kerschbaum #outsourcing #set
- Collusion-resistant outsourcing of private set intersection (FK), pp. 1451–1456.
- CSL-2012-Ehrhard
- Collapsing non-idempotent intersection types (TE), pp. 259–273.
- LICS-2012-BarceloFL #graph #logic #problem
- Graph Logics with Rational Relations and the Generalized Intersection Problem (PB, DF, LL), pp. 115–124.
- RTA-2012-Terui #complexity #evaluation #semantics #λ-calculus
- Semantic Evaluation, Intersection Types and Complexity of Simply Typed λ Calculus (KT), pp. 323–338.
- ICDAR-2011-TanakaTH #documentation #optimisation #robust
- Robust Cell Extraction Method for Form Documents Based on Intersection Searching and Global Optimization (HT, HT, YH), pp. 354–358.
- VLDB-2011-AoZWSWLLL #algorithm #parallel #performance #using
- Efficient Parallel Lists Intersection and Index Compression Algorithms using Graphics Processing Units (NA, FZ, DW, DSS, GW, XL, JL, SL), pp. 470–481.
- VLDB-2011-DingK #in memory #memory management #performance #set
- Fast Set Intersection in Memory (BD, ACK), pp. 255–266.
- FoSSaCS-2011-BernadetL #complexity #normalisation
- Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types (AB, SL), pp. 88–107.
- CIAA-J-2010-CuiGKY11 #complexity
- State Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection (BC, YG, LK, SY), pp. 1797–1812.
- ICALP-v1-2011-Varadaraja #approximate #problem
- Buyback Problem — Approximate Matroid Intersection with Cancellation Costs (ABV), pp. 379–390.
- SIGIR-2011-TatikondaCJ #architecture #manycore
- Posting list intersection on multicore architectures (ST, BBC, FPJ), pp. 963–972.
- SAC-2011-ZhangWAWLL #performance #using
- Fast lists intersection with Bloom filter using graphics processing units (FZ, DW, NA, GW, XL, JL), pp. 825–826.
- CSL-2011-BernadetL #modelling #morphism #orthogonal #polymorphism
- Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism (AB, SL), pp. 51–66.
- TLCA-2011-RehofU #combinator #finite #logic
- Finite Combinatory Logic with Intersection Types (JR, PU), pp. 169–183.
- FoSSaCS-2010-TsukadaK #infinity #recursion
- Untyped Recursion Schemes and Infinite Intersection Types (TT, NK), pp. 343–357.
- STOC-2010-Sherstov #bound
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (AAS), pp. 523–532.
- CIAA-2010-CuiGKY #complexity
- State Complexity of Catenation Combined with Union and Intersection (BC, YG, LK, SY), pp. 95–104.
- ICPR-2010-SaidLF #2d #analysis #multi
- Multiscale Analysis of Digital Segments by Intersection of 2D Digital Lines (MS, JOL, FF), pp. 4097–4100.
- CAV-2010-GhorbalGP #approach #logic
- A Logical Product Approach to Zonotope Intersection (KG, EG, SP), pp. 212–226.
- VLDB-2009-TsirogiannisGK #performance
- Improving the Performance of List Intersection (DT, SG, NK), pp. 838–849.
- STOC-2009-ChalopinG #graph
- Every planar graph is the intersection graph of segments in the plane: extended abstract (JC, DG), pp. 631–638.
- OCSC-2009-EgertJB #social #social media
- When Social Worlds Collide: Charting the Intersection of Social Media and Courseware/Course Management Systems (CAE, SJ, SBB), pp. 452–461.
- OCSC-2009-TsuchihashiO #case study #interface #using
- A Study on the Interface for Viewing the Information Menu of a Town from Intersections Using a Digital Compass (MT, KO), pp. 126–133.
- KDD-2009-ShiJ #linear #statistics
- Anomalous window discovery through scan statistics for linear intersecting paths (SSLIP) (LS, VPJ), pp. 767–776.
- SIGIR-2009-TatikondaJCP #manycore #on the #performance
- On efficient posting list intersection with multicore processors (ST, FJ, BBC, VP), pp. 738–739.
- SAC-2009-VasiraniO #coordination
- Market-based coordination for intersection control (MV, SO), pp. 747–751.
- CSL-2009-Dezani-CiancagliniGR #quantifier
- Intersection, Universally Quantified, and Reference Types (MDC, PG, SRDR), pp. 209–224.
- TLCA-2009-Urzyczyn #rank
- Inhabitation of Low-Rank Intersection Types (PU), pp. 356–370.
- STOC-2008-KhotS #learning #on the
- On hardness of learning intersection of two halfspaces (SK, RS), pp. 345–354.
- DLT-J-2007-HanS08 #complexity #finite
- State Complexity of Union and Intersection of Finite Languages (YSH, KS), pp. 581–595.
- ICPR-2008-SimonB #detection #estimation #geometry #multi #realtime
- Detection of the intersection lines in multiplanar environments: Application to real-time estimation of the camera-scene geometry (GS, MOB), pp. 1–4.
- ICPR-2008-YingZ #detection #performance #using
- Efficient detection of projected concentric circles using four intersection points on a secant line (XY, HZ), pp. 1–4.
- CSL-2008-Dezani-CiancagliniCGT #morphism #on the
- On Isomorphisms of Intersection Types (MDC, RDC, EG, MT), pp. 461–477.
- SIGMOD-2007-RamanQHNCYL #adaptation #lazy evaluation
- Lazy, adaptive rid-list intersection, and its application to index anding (VR, LQ, WH, IN, YLC, KHY, FLL), pp. 773–784.
- FoSSaCS-2007-GollerLL
- PDL with Intersection and Converse Is 2 EXP-Complete (SG, ML, CL), pp. 198–212.
- DLT-2007-HanS #complexity #finite
- State Complexity of Union and Intersection of Finite Languages (YSH, KS), pp. 217–228.
- ICFP-2007-Pfenning #revisited #type system
- Subtyping and intersection types revisited (FP), p. 219.
- HIMI-IIE-2007-SatoA #analysis #behaviour
- Analysis of Naturalistic Driving Behavior While Approaching an Intersection and Implications for Route Guidance Presentation (TS, MA), pp. 618–627.
- TLCA-2007-Kusmierek #problem #rank
- The Inhabitation Problem for Rank Two Intersection Types (DK), pp. 240–254.
- ICALP-v2-2006-KariantoKT #on the #problem #set
- On Intersection Problems for Polynomially Generated Sets (KW, AK, WT), pp. 516–527.
- ICPR-v2-2006-ZhouL #visualisation
- Rectification with Intersecting Optical Axes for Stereoscopic Visualization (JZ, BL), pp. 17–20.
- ICPR-v3-2006-JiaZHW #classification
- Gaussian Weighted Histogram Intersection for License Plate Classification (WJ, HZ, XH, QW), pp. 574–577.
- OOPSLA-2006-NystromQM #composition #scalability
- J&: nested intersection for scalable software composition (NN, XQ, ACM), pp. 21–36.
- LICS-2006-TerauchiA #on the #polymorphism #recursion
- On Typability for Rank-2 Intersection Types with Polymorphic Recursion (TT, AA), pp. 111–122.
- VMCAI-2006-ArnoldMSS #abstraction #analysis
- Combining Shape Analyses by Intersecting Abstractions (GA, RM, MS, RS), pp. 33–48.
- CIAA-J-2004-Yli-Jyra05 #approximate #dependence #regular expression
- Approximating dependency grammars through intersection of star-free regular languages (AYJ), pp. 565–579.
- CIAA-2005-KempeCEGN
- A Class of Rational n-WFSM Auto-intersections (AK, JMC, JE, FG, FN), pp. 188–198.
- ICALP-2005-ChiniforooshanFM #evaluation
- Worst Case Optimal Union-Intersection Expression Evaluation (EC, AF, MM), pp. 179–190.
- ICALP-2005-EfthymiouS #graph #on the #random
- On the Existence of Hamiltonian Cycles in Random Intersection Graphs (CE, PGS), pp. 690–701.
- CSL-2005-Lutz #decidability
- PDL with Intersection and Converse Is Decidable (CL), pp. 413–427.
- TLCA-2005-Damiani #polymorphism #recursion
- Rank-2 Intersection and Polymorphic Recursion (FD), pp. 146–161.
- ESOP-2004-CarlierPWK #flexibility #linear #type system
- System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types (SC, JP, JBW, AJK), pp. 294–309.
- CIAA-2004-Yli-Jyra #approximate #dependence #regular expression
- Approximating Dependency Grammars Through Intersection of Regular Languages (AYJ), pp. 281–292.
- ICALP-2004-NikoletseasRS #graph #independence #performance #random #scalability #set
- The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs (SEN, CR, PGS), pp. 1029–1040.
- PPDP-2004-CarlierW #type inference
- Type inference with expansion variables and intersection types in system E and an exact correspondence with β-reduction (SC, JBW), pp. 132–143.
- DAC-2003-StehrGA #analysis #bound #performance #trade-off
- Performance trade-off analysis of analog circuits by normal-boundary intersection (GS, HEG, KA), pp. 958–963.
- FoSSaCS-2003-DunfieldP #call-by
- Type Assignment for Intersections and Unions in Call-by-Value Languages (JD, FP), pp. 250–266.
- STOC-2003-KaplanMT
- Dynamic rectangular intersection with priorities (HK, EM, RET), pp. 639–648.
- ICALP-2003-BorosEGKM #difference #generative #problem
- An Intersection Inequality for Discrete Distributions and Related Generation Problems (EB, KME, VG, LK, KM), pp. 543–555.
- PPDP-2003-Damiani #rank
- Rank 2 intersection types for modules (FD), pp. 67–78.
- LICS-2003-Kopylov #type system
- Dependent Intersection: A New Way of Defining Records in Type Theory (AK), pp. 86–95.
- TLCA-2003-Boudol #normalisation #on the
- On Strong Normalization in the Intersection Type Discipline (GB), pp. 60–74.
- ICALP-2002-Bala #regular expression
- Intersection of Regular Languages and Star Hierarchy (SB), pp. 159–169.
- CHI-2002-RobertsonCCR #multi #visualisation
- Polyarchy visualization: visualizing multiple intersecting hierarchies (GGR, KC, MC, DCR), pp. 423–430.
- STOC-2001-ChazelleL #bound
- Lower bounds for intersection searching and fractional cascading in higher dimension (BC, DL), pp. 322–329.
- CSL-2001-RoccaR #logic
- Intersection Logic (SRDR, LR), pp. 414–428.
- TLCA-2001-deLiguoro #calculus #convergence
- Characterizing Convergent Terms in Object Calculi via Intersection Types (Ud), pp. 315–328.
- TLCA-2001-DoughertyL #reduction
- Reductions, Intersection Types, and Explicit Substitutions (DJD, PL), pp. 121–135.
- FoSSaCS-2000-Damiani #rank #type system
- Typing Local Definitions and Conditional Expressions with Rank 2 Intersection (FD), pp. 82–97.
- CIAA-2000-Wareham #automaton #complexity #composition #finite #set
- The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata (TW), pp. 302–310.
- ICALP-2000-KumarAR #set
- Hardness of Set Cover with Intersection 1 (VSAK, SA, HR), pp. 624–635.
- ICFP-2000-DaviesP
- Intersection types and computational effects (RD, FP), pp. 198–208.
- LICS-2000-Miquel #type system
- A Model for Impredicative Type Systems, Universes, Intersection Types and Subtyping (AM), pp. 18–29.
- ICFP-1999-KfouryMTW #type system
- Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract) (AJK, HGM, FAT, JBW), pp. 90–101.
- POPL-1999-KfouryW #decidability #type inference
- Principality and Decidable Type Inference for Finite-Rank Intersection Types (AJK, JBW), pp. 161–174.
- LICS-1999-BucciarelliLPS
- Some Computational Properties of Intersection Types (AB, SDL, AP, IS), pp. 109–118.
- SIGAda-1998-ReisnerLPS #ada #algorithm #implementation #self
- Implementing a Culling and Self-Intersection Algorithm for Stereolithography Files in Ada 95 (JAR, ZL, TJP, SAD), pp. 104–113.
- POPL-1998-PalsbergP
- From Polyvariant Flow Information to Intersection and Union Types (JP, CP), pp. 197–208.
- JICSLP-1998-McAloon #linear #logic programming #research
- Disjunctive Linear Programming: At the Intersection of Operations Research and Logic Programming (KM), pp. 5–6.
- LICS-1998-Yokouchi #quantifier
- Completeness of Type Assignment Systems with Intersection, Union, and Type Quantifiers (HY), pp. 368–379.
- LICS-1997-CharatonikP #constraints #set
- Set Constraints with Intersection (WC, AP), pp. 362–372.
- CSCW-1996-RandallR #bound #development #tutorial
- Ethnography and Systems Development: Bounding the Intersection (Tutorial) (DR, MR), p. 5.
- ICPR-1996-BerangerH #recognition
- Recognition of intersections in corridor environments (VB, JYH), pp. 133–137.
- SAC-1996-BurkeS #implementation #parallel
- Data parallel implementation of surface-to-surface intersection (TMB, CLS), pp. 353–357.
- HPCA-1996-YangSD #parallel #query
- Parallel Intersecting Compressed Bit Vectors in a High Speed Query Server for Processing Postal Addresses (WjY, RS, VD), pp. 232–241.
- ICALP-1995-BozanisKMT #bound #problem
- New Upper Bounds for Generalized Intersection Searching Problems (PB, NK, CM, AKT), pp. 464–474.
- TLCA-1995-KurataT #decidability #type system
- Decidable Properties of Intersection Type Systems (TK, MT), pp. 297–311.
- SAC-1994-Sabharwal #algorithm #implementation #performance
- A fast implementation of surface/surface intersection algorithm (CLS), pp. 333–337.
- LICS-1994-Urzyczyn #problem
- The Emptiness Problem for Intersection Types (PU), pp. 300–309.
- ILPS-1993-KohlhaseP #unification #λ-calculus
- Unification in a λ-Calculus with Intersection Types (MK, FP), pp. 488–505.
- TLCA-1993-Bakel #term rewriting
- Partial Intersection Type Assignment in Applicative Term Rewriting Systems (SvB), pp. 29–44.
- TLCA-1993-Pierce #bound #morphism #polymorphism
- Intersection Types and Bounded Polymorphism (BCP), pp. 346–360.
- ICALP-1992-MatousekS #algorithm
- A Tail Estimate for Mulmuley’s Segment Intersection Algorithm (JM, RS), pp. 427–438.
- STOC-1991-BeigelRS
- PP Is Closed Under Intersection (Extended Abstract) (RB, NR, DAS), pp. 1–9.
- DAC-1989-SaucierDP #using
- State Assignment Using a New Embedding Method Based on an Intersecting Cube Theory (GS, CD, FP), pp. 321–326.
- ICALP-1986-Brandenburg #product line
- Intersections of Some Families of Languages (FJB), pp. 60–68.
- ICALP-1985-GabowS #algorithm #performance
- Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract) (HNG, MFMS), pp. 210–220.
- ICALP-1985-KurtzM #algorithm #analysis #distributed #probability #set
- A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (Preliminary Version) (TGK, UM), pp. 356–362.
- STOC-1984-Chazelle #sorting
- Intersecting Is Easier than Sorting (BC), pp. 125–134.
- STOC-1984-FredericksonS #data type #online
- Data Structures for On-Line Updating of Matroid Intersection Solutions (Preliminary Version) (GNF, MAS), pp. 383–390.
- PODS-1983-BeeriK #database
- Elimination of Intersection Anomalies from Database Schemes (CB, MK), pp. 340–351.
- ICALP-1983-Karhumaki #monad
- A Note on Intersections of Free Submonoids of a Free Monoid (JK), pp. 397–407.
- DAC-1982-WieselM #2d #problem
- Two-dimensional channel routing and channel intersection problems (MW, DAM), pp. 733–739.
- ICALP-1982-DobkinK #detection #performance
- Fast Detection of Polyhedral Intersections (DPD, DGK), pp. 154–165.
- ICALP-1980-Furer #complexity #problem #regular expression
- The Complexity of the Inequivalence Problem for Regular Expressions with Intersection (MF), pp. 234–245.
- STOC-1974-BookNP #bound #context-free grammar #linear #multi
- Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract) (RVB, MN, MP), pp. 290–296.
- STOC-1971-GinsburgG #recursion
- Intersection-Closed full AFL and the Recursively Enumerable Languages (SG, JG), pp. 121–131.