Stem connect$ (all stems)

452 papers:

CASE-2015-WatteyneAV #lessons learnt #scalability

Lessons learned from large-scale dense IEEE802.15.4 connectivity traces (TW, CA, XV), pp. 145–150.

PODS-2015-GuhaMT #graph

Vertex and Hyperedge Connectivity in Dynamic Graph Streams (SG, AM, DT), pp. 241–247.

SIGMOD-2015-ChangLQYZ #algorithm #component

Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity (LC, XL, LQ, JXY, WZ), pp. 459–474.

DLT-2015-KlimannPS #automaton #infinity

A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group (IK, MP, DS), pp. 313–325.

ICALP-v1-2015-FullaZ #constraints #infinity

A Galois Connection for Valued Constraint Languages of Infinite Size (PF, SZ), pp. 517–528.

ICALP-v1-2015-GeorgiadisILP #graph

2-Vertex Connectivity in Directed Graphs (LG, GFI, LL, NP), pp. 605–616.

ICALP-v1-2015-GharibianS

Ground State Connectivity of Local Hamiltonians (SG, JS), pp. 617–628.

ICALP-v1-2015-HenzingerKL #component #polynomial

Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time (MH, SK, VL), pp. 713–724.

CHI-2015-BreretonSVR #distance #prototype

The Messaging Kettle: Prototyping Connection over a Distance between Adult Children and Older Parents (MB, AS, KV, PR), pp. 713–716.

CHI-2015-HoubenM #named #prototype #tool support

WatchConnect: A Toolkit for Prototyping Smartwatch-Centric Cross-Device Applications (SH, NM), pp. 1247–1256.

CHI-2015-KayPK #bibliography #classification #evaluation #how

How Good is 85%?: A Survey Tool to Connect Classifier Evaluation to Acceptability of Accuracy (MK, SNP, JAK), pp. 347–356.

CHI-2015-LordHCBWMF #mobile

Demand in My Pocket: Mobile Devices and the Data Connectivity Marshalled in Support of Everyday Practice (CL, MH, AKC, OB, RW, JM, AF), pp. 2729–2738.

CHI-2015-MejovaBW #personalisation

Bridges into the Unknown: Personalizing Connections to Little-known Countries (YM, JBH, IW), pp. 2633–2642.

CHI-2015-YerousisARRRW #bound

Computer-Enabled Project Spaces: Connecting with Palestinian Refugees across Camp Boundaries (GPY, KA, TvR, DWR, MR, VW), pp. 3749–3758.

CSCW-2015-FerreiraPS #social

Spending Time with Money: From Shared Values to Social Connectivity (JF, MJP, SS), pp. 1222–1234.

CSCW-2015-HuangSOSP #online #proximity

Connected Through Crisis: Emotional Proximity and the Spread of Misinformation Online (YLH, KS, MO, SAS, HTP), pp. 969–980.

CSCW-2015-PaayKS #empirical #interactive #physics

Connecting in the Kitchen: An Empirical Study of Physical Interactions while Cooking Together at Home (JP, JK, MBS), pp. 276–287.

CSCW-2015-SharmaC #modelling #people #resource management

Studying and Modeling the Connection between People’s Preferences and Content Sharing (AS, DC), pp. 1246–1257.

CSCW-2015-WebsterNBMWP #community #linked data #named #open data

CURIOS: Connecting Community Heritage through Linked Data (GW, HHN, DEB, CM, CDW, JZP), pp. 639–648.

DUXU-DD-2015-FalcoZ #convergence #design #interface

Design Perspectives to the Design of Interfaces Connected and Convergent for T-Commerce Applications (MF, RZ), pp. 599–608.

HCI-IT-2015-PoirierB #named

UniWatch — Some Approaches Derived from UniGlyph to Allow Text Input on Tiny Devices Such as Connected Watches (FP, MB), pp. 554–562.

HIMI-IKC-2015-HaKKKLHKKKW #development

K-Culture Time Machine: Development of Creation and Provision Technology for Time-Space-Connected Cultural Contents (TH, YK, EK, KK, SL, SH, JIK, SK, JK, WW), pp. 428–435.

KDD-2015-YangSJWDY #learning #visual notation

Structural Graphical Lasso for Learning Mouse Brain Connectivity (SY, QS, SJ, PW, ID, JY), pp. 1385–1394.

KDD-2015-ZhangTYPY #consistency #named #network #social

COSNET: Connecting Heterogeneous Social Networks with Local and Global Consistency (YZ, JT, ZY, JP, PSY), pp. 1485–1494.

MoDELS-2015-AtkinsonGK15a #approach #modelling #multi

A unifying approach to connections for multi-level modeling (CA, RG, TK), pp. 216–225.

CADE-2015-HouGT #automation #logic #proving #theorem proving

Automated Theorem Proving for Assertions in Separation Logic with All Connectives (ZH, RG, AT), pp. 501–516.

ECSA-2014-BennaceurI #architecture #distributed

Layered Connectors — Revisiting the Formal Basis of Architectural Connection for Complex Distributed Systems (AB, VI), pp. 283–299.

DATE-2014-Bolle #roadmap

The connected car and its implication to the automotive chip roadmap (MB), p. 1.

DATE-2014-EusseLASLS #architecture #component #embedded #flexibility

A flexible ASIP architecture for connected components labeling in embedded vision applications (JFE, RL, GA, PS, BL, TS), pp. 1–6.

DATE-2014-LiuJL #parallel

Parallel probe based dynamic connection setup in TDM NoCs (SL, AJ, ZL), pp. 1–6.

DATE-2014-SchlichtmannKAEGGHNW #abstraction #design

Connecting different worlds — Technology abstraction for reliability-aware design and Test (US, VK, JAA, AE, CGD, MG, AH, SRN, NW), pp. 1–8.

DocEng-2014-GormishB

Connecting content and annotations with livestroke (MJG, JB), pp. 131–134.

HT-2014-ChelaruHNS #communication #network

Recognizing skill networks and their specific communication and connection practices (SC, EH, KDN, PS), pp. 13–23.

HT-2014-KawaseSNHN

Exploiting the wisdom of the crowds for characterizing and connecting heterogeneous resources (RK, PS, BPN, EH, WN), pp. 56–65.

SIGMOD-2014-AroraSB #graph #mining #statistics

Mining statistically significant connected subgraphs in vertex labeled graphs (AA, MS, AB), pp. 1003–1014.

VLDB-2014-YanCXLNB #algorithm #graph #performance #problem

Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees (DY, JC, KX, YL, WN, YB), pp. 1821–1832.

ITiCSE-2014-Kurkovsky #mobile

Interdisciplinary connections in a mobile computing and robotics course (SK), pp. 309–314.

ITiCSE-2014-Sohoni

Making the hardware-software connection with PLP (SS), p. 324.

STOC-2014-EneV #algorithm #approximate #bound #design #network #problem #requirements

Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements (AE, AV), pp. 754–763.

STOC-2014-Rossman #distance

Formulas vs. circuits for small distance connectivity (BR), pp. 203–212.

ICALP-v1-2014-BasavarajuFGMRS #algorithm

Parameterized Algorithms to Preserve Connectivity (MB, FVF, PAG, PM, MSR, SS), pp. 800–811.

ICALP-v2-2014-Ghaffari #approximate #distributed #set

Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set (MG), pp. 483–494.

CHI-2014-Hale #multi #network #twitter

Global connectivity and multilinguals in the Twitter network (SAH), pp. 833–842.

CHI-2014-MazmanianE #comprehension #constant

The product of availability: understanding the economic underpinnings of constant connectivity (MM, IE), pp. 763–772.

CHI-2014-VaisutisBRVDNB #people #social

Invisible connections: investigating older people’s emotions and social relations around objects (KV, MB, TR, FV, JD, BN, LB), pp. 1937–1940.

CSCW-2014-Vitak #facebook #maintenance #strict

Facebook makes the heart grow fonder: relationship maintenance strategies among geographically dispersed and communication-restricted connections (JV), pp. 842–853.

HCI-AS-2014-HidakaO

Proposal for a New Entertainment System That Connects Real Life and Net Excitement (KH, KO), pp. 604–613.

SCSM-2014-Biocca #behaviour

Connected to My Avatar: — Effects of Avatar Embodiments on User Cognitions, Behaviors, and Self Construal (FB), pp. 421–429.

CIKM-2014-ZhaoMK #collaboration #personalisation #ranking #social

Leveraging Social Connections to Improve Personalized Ranking for Collaborative Filtering (TZ, JJM, IK), pp. 261–270.

ICML-c2-2014-HuS #machine learning #multi #predict

Multi-period Trading Prediction Markets with Connections to Machine Learning (JH, AJS), pp. 1773–1781.

ICPR-2014-OnalAVFOOY #analysis #modelling

Modeling the Brain Connectivity for Pattern Analysis (IO, EA, BV, OF, MO, IÖ, FTYV), pp. 3339–3344.

ICPR-2014-VaradarajanV #calculus #geometry #representation #visual notation

4D Space-Time Mereotopogeometry-Part Connectivity Calculus for Visual Object Representation (KMV, MV), pp. 4316–4321.

SEKE-2014-PaikariF #analysis #design #implementation #simulation

Analysis, Design and Implementation of an Agent Based System for Simulating Connected Vehicles (EP, BHF), pp. 338–343.

POPL-2014-CousotC #abstract interpretation #calculus

A galois connection calculus for abstract interpretation (PC, RC), pp. 3–4.

FSE-2014-XiaoCK #analysis #architecture #named #quality #tool support

Titan: a toolset that connects software architecture with quality analysis (LX, YC, RK), pp. 763–766.

SPLC-2014-BergerSOHLW #case study #experience #modelling #variability

To connect or not to connect: experiences from modeling topological variability (TB, SS, OØ, ØH, BL, AW), pp. 330–339.

PPoPP-2014-TomkinsSAR #algorithm #component #named #parallel

SCCMulti: an improved parallel strongly connected components algorithm (DT, TGS, NMA, LR), pp. 393–394.

CAV-2014-WijsKB #component #composition #graph

GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components (AW, JPK, DB), pp. 310–326.

IJCAR-2014-Otten #first-order #logic #named #proving

MleanCoP: A Connection Prover for First-Order Modal Logic (JO), pp. 269–276.

DATE-2013-VermesanBJHBM #architecture #ecosystem #mobile

Smart, connected and mobile: architecting future electric mobility ecosystems (OV, LCJB, RJ, PH, RB, AM), pp. 1740–1744.

DATE-2013-WangLPPC #energy #hybrid

Optimal control of a grid-connected hybrid electrical energy storage system for homes (YW, XL, MP, SP, NC), pp. 881–886.

ICDAR-2013-WangSZ #component #detection #multi #segmentation

Natural Scene Text Detection with Multi-channel Connected Component Segmentation (XW, YS, YZ), pp. 1375–1379.

ICDAR-2013-ZirariENM #analysis #component #documentation #image #segmentation #using

A Document Image Segmentation System Using Analysis of Connected Components (FZ, AE, SN, DM), pp. 753–757.

SIGMOD-2013-ChangYQLLL #component #composition #graph

Efficiently computing k-edge connected components via graph decomposition (LC, JXY, LQ, XL, CL, WL), pp. 205–216.

ICALP-v1-2013-BodlaenderCKN #algorithm #exponential #problem

Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (HLB, MC, SK, JN), pp. 196–207.

ICALP-v1-2013-MarxV #algorithm #parametricity

Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation (DM, LAV), pp. 721–732.

ICALP-v2-2013-MertziosMCS #constraints #network #optimisation

Temporal Network Optimization Subject to Connectivity Constraints (GBM, OM, IC, PGS), pp. 657–668.

CHI-2013-AlperBRIF #analysis #comparison #graph

Weighted graph comparison techniques for brain connectivity analysis (BA, BB, NHR, TI, JDF), pp. 483–492.

CHI-2013-Egelman #exclamation #facebook #privacy #trade-off #verification

My profile is my password, verify me!: the privacy/convenience tradeoff of facebook connect (SE), pp. 2369–2378.

CHI-2013-Samp #design #visual notation

Designing graphical menus for novices and experts: connecting design characteristics with design goals (KS), pp. 3159–3168.

CHI-2013-TockerCSC #eye tracking #visualisation

Individual user characteristics and information visualization: connecting the dots through eye tracking (DT, CC, BS, GC), pp. 295–304.

CHI-2013-WycheC #design #how #quote

“I want to imagine how that place looks”: designing technologies to support connectivity between africans living abroad and home (SW, MC), pp. 2755–2764.

CHI-2013-YliriskuLJBSSHR #design #physics

Designing web-connected physical artefacts for the “aesthetic” of the home (SY, SEL, GJ, RB, CDS, AS, RHRH, TR), pp. 909–918.

DHM-HB-2013-KeyvaniLBO #database #metric #using

Using Methods-Time Measurement to Connect Digital Humans and Motion Databases (AK, DL, GB, RÖ), pp. 343–352.

HCI-III-2013-KimKAPW #analysis #artificial reality #social

Brain Function Connectivity Analysis for Recognizing Different Relation of Social Emotion in Virtual Reality (JK, DK, SA, SP, MCW), pp. 441–447.

HCI-UC-2013-Dempster #energy

Connecting Electric Vehicles and Green Energy (PD), pp. 269–276.

HIMI-LCCB-2013-ToumotoHH #development #evaluation #mobile

Development and Evaluation of a Mobile Search System for Science Experiments to Connect School Knowledge to Common Knowledge (TT, TH, TH), pp. 147–156.

HIMI-LCCB-2013-YamamotoKYMH #learning #online #problem

Learning by Problem-Posing with Online Connected Media Tablets (SY, TK, YY, KM, TH), pp. 165–174.

CIKM-2013-AkibaIY #linear #network #random #scalability

Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction (TA, YI, YY), pp. 909–918.

ICML-c1-2013-GongGS #adaptation #invariant #learning

Connecting the Dots with Landmarks: Discriminatively Learning Domain-Invariant Features for Unsupervised Domain Adaptation (BG, KG, FS), pp. 222–230.

ICML-c2-2013-GaneshapillaiGL #learning

Learning Connections in Financial Time Series (GG, JVG, AL), pp. 109–117.

ICML-c3-2013-WanZZLF #network #using

Regularization of Neural Networks using DropConnect (LW, MDZ, SZ, YL, RF), pp. 1058–1066.

ICML-c3-2013-ZhuLM #algorithm #clustering

A Local Algorithm for Finding Well-Connected Clusters (ZAZ, SL, VSM), pp. 396–404.

KDD-2013-ZafaraniL #approach #behaviour #social #social media

Connecting users across social media sites: a behavioral-modeling approach (RZ, HL), pp. 41–49.

KDIR-KMIS-2013-ChenYTH #behaviour #predict

The Disulfide Connectivity Prediction with Support Vector Machine and Behavior Knowledge Space (HYC, CBY, KTT, CYH), pp. 112–118.

Onward-2013-McCorkle #physics

Building connections between theories of computing and physical systems (ELM), pp. 153–172.

ICSE-2013-DeRose #development

The connection between movie making and software development (keynote) (TD), p. 856.

DATE-2012-AksanliRM #energy #network

Benefits of green energy and proportionality in high speed wide area networks connecting data centers (BA, TSR, IM), pp. 175–180.

DATE-2012-StefanMAG #multi #performance

A TDM NoC supporting QoS, multicast, and fast connection set-up (RAS, AMM, JAA, KG), pp. 1283–1288.

DRR-2012-FengY #component #composition #detection #documentation #using

Using connected component decomposition to detect straight line segments in documents (XF, AY).

TFPIE-2012-ODonnell #education #functional #hardware #using

Connecting the Dots: Computer Systems Education using a Functional Hardware Description Language (JTO), pp. 20–39.

PEPM-2012-Voigtlander #bidirectional #induction #synthesis

Ideas for connecting inductive program synthesis and bidirectionalization (JV), pp. 39–42.

SAS-2012-Midtgaard0M #proving

A Structural Soundness Proof for Shivers’s Escape Technique — A Case for Galois Connections (JM, MDA, MM), pp. 352–369.

STOC-2012-Censor-HillelHKM #dependence #performance

Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance (KCH, BH, JAK, PM), pp. 961–970.

ICALP-v1-2012-LaekhanukitGS #approach #problem

A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem (BL, SOG, MS), pp. 606–616.

ICALP-v1-2012-Schmidt #linear

Certifying 3-Connectivity in Linear Time (JMS), pp. 786–797.

CHI-2012-LeeLKS #named

JigsawMap: connecting the past to the future by mapping historical textual cadasters (HL, SL, NK, JS), pp. 463–472.

CSCW-2012-FollmerBRSI #interactive #people #using

People in books: using a FlashCam to become part of an interactive book for connected reading (SF, RB, HR, MS, HI), pp. 685–694.

CSCW-2012-SmithNLLB #communication

Going to college and staying connected: communication between college freshmen and their parents (MES, DTN, CL, GL, EPSB), pp. 789–798.

CIKM-2012-LiuW #analysis #on the #semantics

On the connections between explicit semantic analysis and latent semantic analysis (CL, YMW), pp. 1804–1808.

CIKM-2012-WangHTH #network #topic

Author-conference topic-connection model for academic network search (JW, XH, XT, TH), pp. 2179–2183.

ICPR-2012-BarducciM #component #graph #recognition

Object recognition in floor plans by graphs of white connected components (AB, SM), pp. 298–301.

ICPR-2012-HeCS #algorithm #component

A new algorithm for labeling connected-components and calculating the Euler number, connected-component number, and hole number (LH, YC, KS), pp. 3099–3102.

ICPR-2012-HuynhL #clustering #crowdsourcing

Connecting the dots: Triadic clustering of crowdsourced data to map dirt roads (AH, AL), pp. 3766–3769.

ICPR-2012-KanekoSOFS #consistency #process #recognition

Consistent collective activity recognition with fully connected CRFs (TK, MS, SO, RF, TS), pp. 2792–2795.

ICPR-2012-KramerABSB #component #documentation #programming #robust

Robust stereo correspondence for documents by matching connected components of text-lines with dynamic programming (MK, MZA, SSB, FS, TMB), pp. 734–737.

ICPR-2012-Largeteau-SkapinZASK #set

Optimal consensus set and preimage of 4-connected circles in a noisy environment (GLS, RZ, EA, AS, YK), pp. 3774–3777.

ICPR-2012-RoyH #classification #component #detection #documentation #image #using

Text detection on camera acquired document images using supervised classification of connected components in wavelet domain (UR, GH), pp. 270–273.

ICPR-2012-WilkinsonO #analysis #documentation

Mask-edge connectivity: Theory, computation, and application to historical document analysis (MHFW, JO), pp. 1334–1337.

KDD-2012-ChauAVTF #graph #interactive #named #scalability #visualisation

TourViz: interactive visualization of connection pathways in large graphs (DHC, LA, JV, HT, CF), pp. 1516–1519.

RecSys-2012-AminYSBP #network #recommendation #social

Social referral: leveraging network connections to deliver recommendations (MSA, BY, SS, AB, CP), pp. 273–276.

Onward-2012-TaeumelSH #programming #runtime

The VIVIDE programming environment: connecting run-time information with programmers’ system knowledge (MT, BS, RH), pp. 117–126.

PADL-2012-BromanN #equation #modelling #object-oriented #semantics

Node-Based Connection Semantics for Equation-Based Object-Oriented Modeling Languages (DB, HN), pp. 258–272.

FSE-2012-ChanCL #api

Searching connected API subgraph via text phrases (WKC, HC, DL), p. 10.

CSL-2012-Cook #complexity #proving

Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk) (SAC), pp. 9–11.

CSL-2012-KotekM #graph #matrix #parametricity

Connection Matrices and the Definability of Graph Parameters (TK, JAM), pp. 411–425.

CASE-2011-NaibR #approach #automation #constraints

A P2P approach for automating seamless connectivity given intermittent bandwidth constraints (VVBN, SR), pp. 637–641.

DAC-2011-HongSK #case study #estimation #performance #throughput

Emulation based high-accuracy throughput estimation for high-speed connectivities: case study of USB2.0 (BH, CS, DK), pp. 609–614.

ICDAR-2011-PinsonB #component #using

Connected Component Level Discrimination of Handwritten and Machine-Printed Text Using Eigenfaces (SJP, WAB), pp. 1394–1398.

SIGMOD-2011-OzcanHBBLL #data analysis #enterprise #roadmap

Emerging trends in the enterprise data analytics: connecting Hadoop and DB2 warehouse (FÖ, DH, KSB, AB, CJL, YL), pp. 1161–1164.

SIGMOD-2011-SilbersteinSZC #case study #experience

A batch of PNUTS: experiences connecting cloud batch and serving systems (AS, RS, WZ, BFC), pp. 1101–1112.

MSR-2011-Zhou #debugging #detection #problem

Connecting technology with real-world problems — from copy-paste detection to detecting known bugs: (keynote abstract) (YZ), p. 2.

AFL-2011-Kunimochi #algebra #morphism #petri net

Algebraic Properties of Petri Net Morphisms based on Place Connectivity (YK), pp. 270–284.

DLT-2011-HolzerKL

Nodes Connected by Path Languages (MH, MK, UL), pp. 276–287.

ICALP-v1-2011-Laekhanukit #algorithm #approximate #low cost #set

An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity — (Extended Abstract) (BL), pp. 13–24.

SFM-2011-GraceGBBCIPSSS #architecture

The CONNECT Architecture (PG, NG, AB, GSB, FC, VI, MP, RS, BS, DS), pp. 27–52.

ICFP-2011-GesbertGL #logic #morphism #parametricity #polymorphism #semantics #type system

Parametric polymorphism and semantic subtyping: the logical connection (NG, PG, NL), pp. 107–116.

CHI-2011-JudgeNHB #multi #product line

Family portals: connecting families through a multifamily media space (TKJ, CN, SH, ACB), pp. 1205–1214.

CHI-2011-RaffleRMBBHKCFGS #chat #exclamation #product line #video

Hello, is grandma there? let’s read! StoryVisit: family video chat and connected e-books (HR, GR, KM, RB, KB, HH, JK, KC, NF, JG, MS), pp. 1195–1204.

DUXU-v2-2011-InversiniCB #analysis #assessment #case study #experience #risk management #usability #user interface

Connecting Usages with Usability Analysis through the User Experience Risk Assessment Model: A Case Study in the Tourism Domain (AI, LC, DB), pp. 283–293.

HIMI-v1-2011-HirasawaOY #design #process #user interface

Connecting Envisioning Process to User Interface Design Process (NH, SO, KYK), pp. 13–19.

CAiSE-2011-SchmidtJ #analysis #design #requirements #security #using

Connecting Security Requirements Analysis and Secure Design Using Patterns and UMLsec (HS, JJ), pp. 367–382.

CIKM-2011-WangLF #network

Connecting users with similar interests via tag network inference (XW, HL, WF), pp. 1019–1024.

KDD-2011-HuangLYFCWR #effectiveness #modelling #network

Brain effective connectivity modeling for alzheimer’s disease by sparse gaussian bayesian network (SH, JL, JY, AF, KC, TW, ER), pp. 931–939.

KDIR-2011-Vanetik #algorithm #graph #mining #performance

A Fast Algorithm for Mining Graphs of Prescribed Connectivity (NV), pp. 5–13.

KMIS-2011-SchmidlK #information management #using

Using Task Histories to Support Person-to-person Knowledge Exchange — Extracting and using Contextual Overlap and Levels of Expertise to Connect Knowledge Workers (JS, HK), pp. 77–86.

Onward-2011-TillmannMHF #mobile #named #programming

TouchDevelop: programming cloud-connected mobile devices via touchscreen (NT, MM, JdH, MF), pp. 49–60.

SAC-2011-BoscP #axiom #flexibility #fuzzy #on the #retrieval

On three fuzzy connectives for flexible data retrieval and their axiomatization (PB, OP), pp. 1114–1118.

SAC-2011-Zhang #analysis #constraints #geometry #graph #problem

Well-constrained completion for under-constrained geometric constraint problem based on connectivity analysis of graph (GFZ), pp. 1094–1099.

CADE-2011-GalmicheM

A Connection-Based Characterization of Bi-intuitionistic Validity (DG, DM), pp. 268–282.

SAT-2011-Williams #algorithm #bound #complexity #satisfiability

Connecting SAT Algorithms and Complexity Lower Bounds (RW), pp. 1–2.

ECSA-2010-SuYZ #architecture #specification

An ADL-Approach to Specifying and Analyzing Centralized-Mode Architectural Connection (GS, MY, CZ), pp. 8–23.

DAC-2010-KaoCTC #detection #performance

An efficient phase detector connection structure for the skew synchronization system (YCK, HMC, KTT, SCC), pp. 729–734.

DATE-2010-Sangiovanni-Vincentelli

All things are connected (ALSV), p. 1.

HT-2010-LiangXLNT #personalisation #recommendation

Connecting users and items with weighted tags for personalized item recommendations (HL, YX, YL, RN, XT), pp. 51–60.

SIGMOD-2010-ShangLZYW #similarity

Connected substructure similarity search (HS, XL, YZ, JXY, WW), pp. 903–914.

ICPC-2010-MatthijssenZSBD #ajax #comprehension #interactive

Connecting Traces: Understanding Client-Server Interactions in Ajax Applications (NM, AZ, MADS, RIB, AvD), pp. 216–225.

STOC-2010-DuanP #graph

Connectivity oracles for failure prone graphs (RD, SP), pp. 465–474.

STOC-2010-Vegh

Augmenting undirected node-connectivity by one (LAV), pp. 563–572.

ICALP-v1-2010-Duan #data type

New Data Structures for Subgraph Connectivity (RD), pp. 201–212.

ICALP-v1-2010-Georgiadis #graph #testing

Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs (LG), pp. 738–749.

CHI-2010-VenoliaTCBRLI #social

Embodied social proxy: mediating interpersonal connection in hub-and-satellite teams (GV, JCT, RC, SB, GGR, BL, KI), pp. 1049–1058.

CIKM-2010-ChenHZLRHP #automation #image #probability #topic

A probabilistic topic-connection model for automatic image annotation (XC, XH, ZZ, CL, GR, TH, EKP), pp. 899–908.

CIKM-2010-KazaiMHMILMM #information management #online

Connecting the local and the online in information management (GK, NMF, TH, NM, KI, AL, PM, MM), pp. 1941–1942.

CIKM-2010-TianHZLL #network #social

Boosting social network connectivity with link revival (YT, QH, QZ, XL, WCL), pp. 589–598.

ICML-2010-AsuncionLIS

Particle Filtered MCMC-MLE with Connections to Contrastive Divergence (AUA, QL, ATI, PS), pp. 47–54.

ICPR-2010-AwaisM #recognition

Feature Pairs Connected by Lines for Object Recognition (MA, KM), pp. 3093–3096.

ICPR-2010-ChakrabortyE #locality

Object Localization by Propagating Connectivity via Superfeatures (IC, AME), pp. 3069–3072.

ICPR-2010-PerretLCS #component #image #multi

Connected Component Trees for Multivariate Image Processing and Applications in Astronomy (BP, SL, CC, ÉS), pp. 4089–4092.

ICPR-2010-SagheerNHS #analysis #component #novel #word

A Novel Handwritten Urdu Word Spotting Based on Connected Components Analysis (MWS, NN, CLH, CYS), pp. 2013–2016.

KDD-2010-ShahafG

Connecting the dots between news articles (DS, CG), pp. 623–632.

KR-2010-Shapiro #logic #semantics #syntax

Set-Oriented Logical Connectives: Syntax and Semantics (SCS).

RecSys-2010-DalyGM #network #recommendation #social

The network effects of recommending social connections (EMD, WG, DRM), pp. 301–304.

SAC-2010-Kaneiwa #approach #information management #mining #set

A rough set approach to mining connections from information systems (KK), pp. 990–996.

SAC-2010-MabuchiSHSK #data access #named

CapaCon: access control mechanism for inter-device communications through TCP connections (MM, YS, KH, AS, KK), pp. 706–712.

SAC-2010-Makela #array #concept

Concept for providing guaranteed service level over an array of unguaranteed commodity connections (AM), pp. 678–683.

ASPLOS-2010-YuanMXTZP #fault #named #runtime

SherLog: error diagnosis by connecting clues from run-time logs (DY, HM, WX, LT, YZ, SP), pp. 143–154.

SAT-2010-MakinoTY #algorithm #problem

An Exact Algorithm for the Boolean Connectivity Problem for k-CNF (KM, ST, MY), pp. 172–180.

DAC-2009-Chou #cyber-physical #user interface

Endosymbiotic computing: enabling surrogate GUI and cyber-physical connectivity (PHC), pp. 625–626.

DAC-2009-PellauerACE #composition #problem

Soft connections: addressing the hardware-design modularity problem (MP, MA, DC, JSE), pp. 276–281.

HT-2009-NeubauerO #component #network

Hyperincident connected components of tagging networks (NN, KO), pp. 229–238.

ICDAR-2009-NaegelW #documentation

Document Binarization Based on Connected Operators (BN, LW), pp. 316–320.

ICDAR-2009-PereiraC #classification #prototype

Prototype Selection for Handwritten Connected Digits Classification (CdSP, GDCC), pp. 1021–1025.

VLDB-2009-AggarwalXY #graph #named

GConnect: A Connectivity Index for Massive Disk-resident Graphs (CCA, YX, PSY), pp. 862–873.

WRLA-2008-HolenJW09 #calculus #first-order #maude #proving

Proof Search for the First-Order Connection Calculus in Maude (BH, EBJ, AW), pp. 173–188.

FASE-2009-HuismanT #automaton #ml #security

A Formal Connection between Security Automata and JML Annotations (MH, AT), pp. 340–354.

ICALP-v1-2009-ChekuriK #graph #reduction

A Graph Reduction Step Preserving Element-Connectivity and Applications (CC, NK), pp. 254–265.

FM-2009-LausdahlLL #tool support #uml

Connecting UML and VDM++ with Open Tool Support (KL, HKAL, PGL), pp. 563–578.

HCI-NIMT-2009-LeeJLYP #gesture #interface #multi

Gesture-Based Interface for Connection and Control of Multi-device in a Tabletop Display Environment (HL, HJ, JHL, KWY, JHP), pp. 216–225.

HCI-VAD-2009-ParkH #comprehension #game studies #online

Understanding Online Game Addiction: Connection between Presence and Flow (SP, HSH), pp. 378–386.

IDGD-2009-Rodriguez #community

Affordable Wireless Connectivity Linking Poor Latin American Communities Binding Their Schools by Sharing ICT Training for “Maestros” of Primary Schools (COR), pp. 404–412.

CIKM-2009-ChengKN #graph #performance #query #scalability

Efficient processing of group-oriented connection queries in a large graph (JC, YK, WN), pp. 1481–1484.

KDD-2009-ChangBB #network #social

Connections between the lines: augmenting social networks with text (JC, JLBG, DMB), pp. 169–178.

KDD-2009-SunPLCWLRY #estimation #mining

Mining brain region connectivity for alzheimer’s disease study via sparse inverse covariance estimation (LS, RP, JL, KC, TW, JL, ER, JY), pp. 1335–1344.

ASE-2008-HegdeD #ad hoc #collaboration #programming

Connecting Programming Environments to Support Ad-Hoc Collaboration (RH, PD), pp. 178–187.

HT-2008-ShiBAG

The very small world of the well-connected (XS, MB, LAA, ACG), pp. 61–70.

STOC-2008-ChakrabortyCK #design #network

Network design for vertex connectivity (TC, JC, SK), pp. 167–176.

STOC-2008-FakcharoenpholL #algorithm #approximate #problem

An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem (JF, BL), pp. 153–158.

ICALP-A-2008-BorradaileK #graph #network #problem

The Two-Edge Connectivity Survivable Network Problem in Planar Graphs (GB, PNK), pp. 485–501.

ICALP-A-2008-YoshidaI #graph #testing

Property Testing on k-Vertex-Connectivity of Graphs (YY, HI), pp. 539–550.

ICALP-B-2008-EgriLT #datalog #symmetry

Directed st-Connectivity Is Not Expressible in Symmetric Datalog (LE, BL, PT), pp. 172–183.

ICALP-B-2008-GruberH #automaton #finite #regular expression

Finite Automata, Digraph Connectivity, and Regular Expression Size (HG, MH), pp. 39–50.

LATA-2008-Klunder #automaton #finite #using

Characterization of Star-Connected Languages Using Finite Automata (BK), pp. 311–320.

CSCW-2008-LiaoL #design #effectiveness #network #user interface

Network patterns: designing effective user interfaces for connections management at work (QL, QL), pp. 707–710.

CAiSE-2008-VanderfeestenRMAC #metric #modelling #on the #process

On a Quest for Good Process Models: The Cross-Connectivity Metric (ITPV, HAR, JM, WMPvdA, JC), pp. 480–494.

ICEIS-ISAS2-2008-GinerAP #process #ubiquitous

Physical-Virtual Connection in Ubiquitous Business Processes (PG, MA, VP), pp. 266–271.

ICEIS-ISAS2-2008-Prpitsch #process #using

From Process to Software Systems’ Service — Using a Layered Model to Connect Technical and Process-related Views (CP), pp. 298–304.

ICPR-2008-GuoYZZY #embedded #markov #random #using

Face super-resolution using 8-connected Markov Random Fields with embedded prior (KG, XY, RZ, GZ, SY), pp. 1–4.

ICPR-2008-MurakamiTSM #assembly

Assembly of puzzles by connecting between blocks (TM, FT, KS, JM), pp. 1–4.

KDD-2008-MadaniH #learning #on the

On updates that constrain the features’ connections during learning (OM, JH), pp. 515–523.

PPDP-2008-SilvaO #functional #prototype #proving #quote

“Galculator”: functional prototype of a Galois-connection based proof assistant (PFS, JNO), pp. 44–55.

REFSQ-2008-WebersTS #approach #feature model #modelling #requirements

Connecting Feature Models and AUTOSAR: An Approach Supporting Requirements Engineering in Automotive Industries (WW, CT, KS), pp. 95–108.

SAC-2008-LinWZW #on the #performance #persistent #web

On the performance of persistent connection in modern web servers (XzL, HyW, JjZ, YxW), pp. 2403–2408.

HPDC-2008-GangulyBWF

Improving peer connectivity in wide-area overlays of virtual workstations (AG, POB, DW, RJOF), pp. 129–140.

ICST-2008-YoonJC #generative #requirements

Generating Test Requirements for the Service Connections based on the Layers of SOA (HY, EMJ, BC), pp. 348–355.

DAC-2007-Levitan #graph #random

You Can Get There From Here: Connectivity of Random Graphs on Grids (SPL), pp. 272–273.

SIGMOD-2007-CormodeG07a #data type #distributed #query #streaming

Streaming in a connected world: querying and tracking distributed data streams (GC, MNG), pp. 1178–1181.

STOC-2007-PeikertR #worst-case

Lattices that admit logarithmic worst-case to average-case connection factors (CP, AR), pp. 478–487.

CIAA-2007-Klunder #automaton #finite

Finite Automata Accepting Star-Connected Languages (BK), pp. 312–313.

ICALP-2007-BergerG #graph

Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs (AB, MG), pp. 90–101.

ICALP-2007-FellowsFHV #graph

Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs (MRF, GF, DH, SV), pp. 340–351.

ICALP-2007-Korman

Labeling Schemes for Vertex Connectivity (AK), pp. 102–109.

AGTIVE-2007-Kortgen #modelling

Modeling Successively Connected Repetitive Subgraphs (ATK), pp. 426–441.

HCI-AS-2007-Shrimpton-SmithZ #design #question #web

Does the Web Design Disconnect the Emotional Connection? (TSS, BZ), pp. 1009–1018.

HIMI-MTT-2007-Watanabe07a #communication

Human-Entrained E-COSMIC: Embodied Communication System for Mind Connection (TW), pp. 1008–1016.

OCSC-2007-MorrisonG #interactive #named #network #social #visualisation

ConnectDots: Visualizing Social Network Interaction for Improved Social Decision Making (DM, BG), pp. 134–140.

SAC-2007-YapaK #algorithm #component #image

A connected component labeling algorithm for grayscale images and application of the algorithm on mammograms (RDY, HK), pp. 146–152.

ESEC-FSE-2007-CalegariMRM #generative #mobile #named #performance #testing

CTG: a connectivity trace generator for testing the performance of opportunistic mobile systems (RC, MM, FR, CM), pp. 415–424.

HPDC-2007-MaassenB #grid #named #problem

Smartsockets: solving the connectivity problems in grid computing (JM, HEB), pp. 1–10.

PPoPP-2007-MamidalaNVSP #on the #performance #scalability #trade-off #using

On using connection-oriented vs. connection-less transport for performance and scalability of collective and one-sided operations: trade-offs and impact (ARM, SN, AV, GS, DKP), pp. 46–54.

PPoPP-2007-SaitoT #rank

Locality-aware connection management and rank assignment for wide-area MPI (HS, KT), pp. 150–151.

SAT-2007-MakinoTY #on the #problem

On the Boolean Connectivity Problem for Horn Relations (KM, ST, MY), pp. 187–200.

VLDB-2006-CormodeG #streaming

Streaming in a Connected World (GC, MNG), p. 1266.

DLT-J-2005-Tsin06 #algorithm #distributed #performance

An Efficient Distributed Algorithm for 3-edge-connectivity (YHT), pp. 677–702.

ICALP-v1-2006-GopalanKMP #satisfiability

The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies (PG, PGK, ENM, CHP), pp. 346–357.

ICALP-v1-2006-KortsarzN #algorithm #approximate #problem

Tight Approximation Algorithm for Connectivity Augmentation Problems (GK, ZN), pp. 443–452.

ICALP-v1-2006-RaoZ #graph

Edge Disjoint Paths in Moderately Connected Graphs (SR, SZ), pp. 202–213.

ICPR-v4-2006-Yang #graph #linear

Building Connected Neighborhood Graphs for Locally Linear Embedding (LY), pp. 194–197.

SEKE-2006-FabresseDH #component

Unanticipated Connection of Components Based on Their State Changes Notifications (LF, CD, MH), pp. 702–707.

SAC-2006-ZhangG #composition #constraints #geometry #graph #theorem proving

Spatial geometric constraint solving based on k-connected graph decomposition (GFZ, XSG), pp. 979–983.

OSDI-2006-FordSLRKM #mobile #persistent

Persistent Personal Names for Globally Connected Mobile Devices (BF, JS, CLL, SCR, MFK, RM), pp. 233–248.

OSDI-2006-KimR #interface #network #policy

Connection Handoff Policies for TCP Offload Network Interfaces (HyK, SR), pp. 293–306.

IJCAR-2006-Paskevich #lazy evaluation

Connection Tableaux with Lazy Paramodulation (AP), pp. 112–124.

LICS-2006-MacielP #bound #composition #proving

Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives (AM, TP), pp. 189–200.

DATE-2005-BjerregaardS #architecture

A Router Architecture for Connection-Oriented Service Guarantees in the MANGO Clockless Network-on-Chip (TB, JS), pp. 1226–1231.

ICDAR-2005-ShiSG #adaptation #documentation #image #using

Text Extraction from Gray Scale Historical Document Images Using Adaptive Local Connectivity Map (ZS, SS, VG), pp. 794–798.

ICDAR-2005-Suwa #graph #representation #segmentation

Segmentation of Connected Handwritten Numerals by Graph Representation (MS), pp. 750–754.

ICDAR-2005-WeiMJ #algorithm #search-based #segmentation

Segmentation of Connected Chinese Characters Based on Genetic Algorithm (XW, SM, YJ), pp. 645–649.

STOC-2005-BasuPR #algebra #component #set

Computing the first Betti number and the connected components of semi-algebraic sets (SB, RP, MFR), pp. 304–312.

STOC-2005-Reingold

Undirected ST-connectivity in log-space (OR), pp. 376–385.

STOC-2005-Trifonov #algorithm

An O(log n log log n) space algorithm for undirected st-connectivity (VT), pp. 626–633.

CIAA-2005-PelanekS #automaton #ltl

Deeper Connections Between LTL and Alternating Automata (RP, JS), pp. 238–249.

FM-2005-Bosnacki #abstraction #calculus #on the #μ-calculus

On Some Galois Connection Based Abstractions for the μ-Calculus (DB), pp. 366–381.

CHI-2005-AyatsukaR #named

tranSticks: physically manipulatable virtual connections (YA, JR), pp. 251–260.

CIKM-2005-Das-NevesFY #documentation #topic

Connecting topics in document collections with stepping stones and pathways (FADN, EAF, XY), pp. 91–98.

KDD-2005-Yang #graph

Building connected neighborhood graphs for isometric data embedding (LY), pp. 722–728.

KDD-2005-YanZH #constraints #graph #mining #relational

Mining closed relational graphs with connectivity constraints (XY, XJZ, JH), pp. 324–333.

POPL-2005-BoylandR

Connecting effects and uniqueness with adoption (JTB, WR), pp. 283–295.

SAC-2005-FarahabadyS #multi #network #recursion

The recursive transpose-connected cycles (RTCC) interconnection network for multiprocessors (MHF, HSA), pp. 734–738.

SAC-2005-FoutHD #optimisation #visualisation

Visualization of neuronal fiber connections from DT-MRI with global optimization (NF, JH, ZD), pp. 1200–1206.

SAC-2005-YoonYMWD #3d #interactive #network #visualisation

Interactive 3D visualization of highly connected ecological networks on the WWW (IY, SY, NDM, RJW, JAD), pp. 1207–1212.

SOSP-2005-SoulesG #named #using

Connections: using context to enhance file search (CANS, GRG), pp. 119–132.

CADE-2005-BaaderG

Connecting Many-Sorted Theories (FB, SG), pp. 278–294.

SIGMOD-2004-BohmKKZ #clustering #correlation

Computing Clusters of Correlation Connected Objects (CB, KK, PK, AZ), pp. 455–466.

PLDI-2004-KodumalA #constraints #reachability #set

The set constraint/CFL reachability connection in practice (JK, AA), pp. 207–218.

STOC-2004-KortsarzN #algorithm #approximate #graph

Approximation algorithm for k-node connected subgraphs via critical graphs (GK, ZN), pp. 138–145.

STOC-2004-PatrascuD #bound

Lower bounds for dynamic connectivity (MP, EDD), pp. 546–553.

CHI-2004-BadeSM #interactive #visualisation

Connecting time-oriented data and information to a coherent interactive visualization (RB, SS, SM), pp. 105–112.

ICEIS-v1-2004-EsichaikulN #enterprise

Connectivity of ERP System (VE, PN), pp. 37–44.

ICEIS-v4-2004-BoppHE #weaving

Connecting Virtual Spaces: Shadow Objects as Key Elements for Weaving the Cooperative Space (TB, TH, BE), pp. 475–479.

ICPR-v1-2004-MitchellY #image #segmentation

Connected Pattern Segmentation and Title Grouping in Newspaper Images (PEM, HY), pp. 397–400.

ICPR-v1-2004-SugimuraS #re-engineering

Camera Calibration and Reconstruction from the Chain Connection of Mutual Camera Projections (YS, JS), pp. 100–103.

ICPR-v1-2004-UrbachRW #invariant

Connected Rotation-Invariant Size-Shape Granulometries (ERU, JBTMR, MHFW), pp. 688–691.

ICPR-v1-2004-Yang04a #distance #estimation #graph

k-Edge Connected Neighborhood Graph for Geodesic Distance Estimation and Nonlinear Data Projection (LY), pp. 196–199.

ICPR-v4-2004-LeeNG #automation #detection

Automated Detection of Solar Loops by the Oriented Connectivity Method (JKL, TSN, GAG), pp. 315–318.

ICPR-v4-2004-OrtizMG #image

Gaussian Noise Elimination in Colour Images by Vector-Connected Filters (FO, FTM, PG), pp. 807–810.

KDD-2004-FaloutsosMT #performance

Fast discovery of connection subgraphs (CF, KSM, AT), pp. 118–127.

SAC-2004-Wang

The loop fallacy and serialization in tracing intrusion connections through stepping stones (XW), pp. 404–411.

HPDC-2004-DenisAHVKB #communication #performance #problem #security

Wide-Area Communication for Grids: An Integrated Solution to Connectivity, Performance and Security Problems (AD, OA, RFHH, KV, TK, HEB), pp. 97–106.

HT-2003-AmitayCDLS #detection

The connectivity sonar: detecting site functionality by structural patterns (EA, DC, AD, RL, AS), pp. 38–47.

ICDAR-2003-AlhajjE #approach #novel

A Novel Approach to Separate Handwritten Connected Digits (RA, AE), pp. 1198–1202.

ITiCSE-2003-PearsD #research

Structuring CSed research studies: connecting the pieces (ANP, MD), pp. 149–153.

ITiCSE-2003-SchwarmV #assessment #concept #elicitation #information management #student #using

Making connections: using classroom assessment to elicit students’ prior knowledge and construction of concepts (SES, TV), pp. 65–69.

STOC-2003-ColeH #algorithm #performance

A fast algorithm for computing steiner edge connectivity (RC, RH), pp. 167–176.

ICALP-2003-AlbersS #case study #documentation

A Study of Integrated Document and Connection Caching (SA, RvS), pp. 653–667.

ICEIS-v2-2003-IsikK #network #problem

Partially Connected Neural Networks for Mapping Problems (CI, SK), pp. 469–473.

ICML-2003-KubicaMCS #analysis #collaboration #graph #performance #query

Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries (JK, AWM, DC, JGS), pp. 392–399.

OOPSLA-2003-HirzelDH #garbage collection

Connectivity-based garbage collection (MH, AD, MH), pp. 359–373.

SAC-2003-BeattyCGN #embedded #interpreter #java

An Optimized Java Interpreter for Connected Devices and Embedded Systems (AB, KC, DG, AN), pp. 692–697.

SAC-2003-VulloF #approach #predict #recursion

A Recursive Connectionist Approach for Predicting Disulfide Connectivity in Proteins (AV, PF), pp. 67–71.

DATE-2002-GrunDN #memory management

Memory System Connectivity Exploration (PG, NDD, AN), pp. 894–901.

VLDB-2002-CiliaHB #internet #profiling

Profiling and Internet Connectivity in Automotive Environments (MC, PH, APB), pp. 1071–1074.

FASE-2002-BernardoF #architecture

Architectural Types Revisited: Extensible And/Or Connections (MB, FF), pp. 113–127.

STOC-2002-Chan #geometry

Dynamic subgraph connectivity with geometric applications (TMC), pp. 7–13.

STOC-2002-CheriyanVV #algorithm #approximate #low cost

Approximation algorithms for minimum-cost k-vertex connected subgraphs (JC, SV, AV), pp. 306–312.

STOC-2002-Micciancio #encryption #worst-case

Improved cryptographic hash functions with worst-case/average-case connection (DM), pp. 609–618.

CIAA-J-2000-Ibarra02 #multi #verification

Verification in Queue-Connected Multicounter Machines (OHI), pp. 115–127.

ICPR-v1-2002-YuanGYW #modelling #recognition

Recognition of Strong and Weak Connection Models in Continuous Sign Language (QY, WG, HY, CW), pp. 75–78.

ICPR-v3-2002-CaputoBN #markov #random #recognition #robust #using

Robust Appearance-Based Object Recognition Using a Fully Connected Markov Random Field (BC, SB, HN), pp. 565–568.

KR-2002-KutzWZ

Connecting Abstract Description Systems (OK, FW, MZ), pp. 215–226.

ICSE-2002-AldrichCN #architecture #implementation #named

ArchJava: connecting software architecture to implementation (JA, CC, DN), pp. 187–197.

ISMM-2002-HirzelHDH #comprehension

Understanding the connectivity of heap objects (MH, JH, AD, MH), pp. 143–156.

CADE-2002-GalmicheM #logic #proving

Connection-Based Proof Search in Propositional BI Logic (DG, DM), pp. 111–128.

CBSE-2001-Weide #component #composition #testing

Modular Regression Testing: Connections to Component-Based Software (BWW), p. 11.

HT-2001-Miles #hypermedia

Hypertext structure as the event of connection (AM), pp. 61–68.

ICDAR-2001-MitchellY #analysis #documentation #segmentation

Newspaper Document Analysis Featuring Connected Line Segmentation (PEM, HY), pp. 1181–1185.

ICDAR-2001-YamaguchiYSTT #segmentation

A Segmentation Method for Touching Japanese Handwritten Characters Based on Connecting Condition of Line (TY, TY, TS, ST, MT), pp. 837–843.

ICDAR-2001-ZhengLDP #detection

Form Frame Line Detection with Directional Single-Connected Chain (YZ, CL, XD, SP), pp. 699–703.

IWPC-2001-BrilP #architecture #incremental #legacy #metric #scalability

An Architectural Connectivity Metric and Its Support for Incremental Re-Architecting of Large Legacy Systems (RJB, AP), pp. 269–280.

WCRE-2001-GannodG #dependence #graph

An Investigation into the Connectivity Properties of Source-Header Dependency Graphs (GCG, BDG), pp. 115–126.

ICEIS-v2-2001-JeongNSL #assurance #framework #named

C-ISCAP: Controlled-Internet Secury Connectivity Assurance Platform (JHJ, JN, SWS, JTL), pp. 920–925.

CIKM-2001-FordREMKJG #semantics

Tempus Fugit: A System for Making Semantic Connections (DAF, JR, SE, JM, JHK, JJ, MG), pp. 520–522.

SAC-2001-DowellB #graph #mobile #monte carlo #network #random #simulation #validation

Connectivity of random graphs and mobile networks: validation of Monte Carlo simulation results (LJD, MLB), pp. 77–81.

CC-2001-FarreG #bound #parsing

A Bounded Graph-Connect Construction for LR-regular Parsers (JF, JFG), pp. 244–258.

IJCAR-2001-HahnleMR #graph #order

Ordered Resolution vs. Connection Graph Resolution (RH, NVM, ER), pp. 182–194.

IJCAR-2001-HodasT #agile #first-order #implementation #linear #logic #named #proving #theorem proving

lolliCop — A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic (JSH, NT), pp. 670–684.

IJCAR-2001-SchmittLKN #interactive #proving #theorem proving

JProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants (SS, LL, CK, AN), pp. 421–426.

DAC-2000-FotyB #design #modelling #tutorial

MOSFET modeling and circuit design: re-establishing a lost connection (tutorial) (DF, DB), p. 560.

DAC-2000-GoelL #verification

Formal verification of an IBM CoreConnect processor local bus arbiter core (AG, WRL), pp. 196–200.

PODS-2000-BenediktGLS #constraints #database #query #reachability

Reachability and Connectivity Queries in Constraint Databases (MB, MG, LL, LS), pp. 104–115.

ITiCSE-2000-DannCP #programming

Making the connection: programming with animated small world (WD, SC, RP), pp. 41–44.

STOC-2000-KempeKK #network #problem

Connectivity and inference problems for temporal networks (DK, JMK, AK), pp. 504–513.

STOC-2000-RasalaW #network #strict

Strictly non-blocking WDM cross-connects for heterogeneous networks (AR, GTW), pp. 514–523.

STOC-2000-Thorup #graph

Near-optimal fully-dynamic graph connectivity (MT), pp. 343–350.

ICALP-2000-CzumajL #approximate #multi #performance #problem

Fast Approximation Schemes for Euclidean Multi-connectivity Problems (AC, AL), pp. 856–868.

ICEIS-2000-HeathC #communication #mobile #multi

Application of a Virtual Connection Tree over Multiple Access Techniques for 3G Mobile Communication Systems (AH, RAC), pp. 531–532.

ICPR-v1-2000-FontaineMP #analysis #segmentation

Unsupervised Segmentation Based on Connectivity Analysis (MF, LM, JGP), pp. 1660–1663.

ICPR-v2-2000-ChenW #analysis #segmentation #string #using

Segmentation of Handwritten Connected Numeral String Using Background and Foreground Analysis (YKC, JFW), pp. 2598–2601.

ICPR-v2-2000-SuzukiHS #component #performance

Fast Connected-Component Labeling Based on Sequential Local Operations in the Course of Forward Raster Scan Followed by Backward Raster Scan (KS, IH, NS), pp. 2434–2437.

ICPR-v3-2000-SalembierG

Connected Operators Based on Region-Tree Pruning Strategies (PS, JLG), pp. 3371–3374.

ICPR-v3-2000-VassZ #analysis #component #fault #image #performance

Enhanced Significance-Linked Connected Component Analysis for High Performance Error Resilient Wavelet Image Coding (JV, XZ), pp. 3075–3078.

TOOLS-EUROPE-2000-McDowellS #network

Connecting Non-Java Devices to a Jini Network (CEM, KS), pp. 45–56.

TOOLS-USA-2000-Pour00a #hardware #named #towards

JINI: Towards Seamless Connectivity of Hardware and Software Services [Abstract] (GP), pp. 463–464.

CADE-2000-Seger #float #model checking #proving #theorem proving

Connecting Bits with Floating-Point Numbers: Model Checking and Theorem Proving in Practice (CJHS), p. 235.

ASE-1999-KyaruziK #architecture #component #constraints

Beyond Components-Connections-Constraints: Dealing with Software Architecture Difficulties (JJK, JvK), pp. 235–242.

ICDAR-1999-ZhuSW #algorithm #fourier #image

A New Distinguishing Algorithm of Connected Character Image based on Fourier Transform (XZ, YS, SW), pp. 788–791.

STOC-1999-CohenKZ

Connection Caching (EC, HK, UZ), pp. 612–621.

ICALP-1999-Kirsten #finite #monad #problem

A Connection between the Star Problem and the Finite Power Property in Trace Monoids (DK), pp. 473–482.

HCI-EI-1999-PlocherGC #design #user interface

Connecting Culture, User Characteristics and User Interface Design (TAP, CG, JC), pp. 803–807.

EDOC-1999-LangerN #enterprise #specification

An ODP enterprise specification of customer service management for connectivity services (ML, MN), pp. 94–103.

TOOLS-USA-1999-GrissCBKO #question #workflow

Agents and Workflow — An Intimate Connection, or Just Friends? (MLG, QC, GAB, RRK, LJO), pp. 558–562.

CADE-1999-BaumgartnerEF #calculus #confluence

A Confluent Connection Calculus (PB, NE, UF), pp. 329–343.

RTA-1999-Otto #formal method #on the

On the Connections between Rewriting and Formal Language Theory (FO), pp. 332–355.

DATE-1998-SongSZ #clustering #concept #effectiveness

An Effective General Connectivity Concept for Clustering (JS, ZS, WZ), pp. 398–405.

STOC-1998-HolmLT #algorithm

Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity (JH, KdL, MT), pp. 79–89.

ICALP-1998-CzumajL #approximate #polynomial

A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity (AC, AL), pp. 682–694.

IFL-1998-Reinke #haskell #java #towards

Towards a Haskell/Java Connection (CR), pp. 200–215.

CSCW-1998-MyersSG #collaboration #multi #using

Collaboration Using Multiple PDAs Connected to a PC (BAM, HS, RG), pp. 285–294.

ICPR-1998-AricaY #recognition

A new scheme for off-line handwritten connected digit recognition (NA, FTYV), pp. 1127–1129.

ICPR-1998-KawaiUIST #using

Stereo correspondence using segment connectivity (YK, TU, YI, YS, FT), pp. 648–651.

KR-1998-Renz #calculus #canonical

A Canonical Model of the Region Connection Calculus (JR), pp. 330–341.

SAC-1998-Li #evaluation #performance #probability

Performance evaluation of probabilistic tree embedding in cube-connected cycles (KL), pp. 584–592.

SAC-1998-ZollerS #automation #database #named #taxonomy #tool support

WEBCON: a toolkit for an automatic, data dictionary based connection of databases to the WWW (PZ, US), pp. 706–711.

HPDC-1998-McRobbieMAGPRWW #education #network #performance #research

Global High Performance Networking: Connecting the vNBS and the Asia-Pacific Advanced Network for Research and Education Applications (MAM, DFM, KHA, DG, DDP, RAR, SSW, JGW), pp. 252–259.

CADE-1998-Letz #using

Using Matings for Pruning Connection Tableaux (RL), pp. 381–396.

EDTC-1997-WahbaB #fault

Connection error location and correction in combinational circuits (AMW, DB), pp. 235–241.

HT-1997-HusemannPKKH #adaptation #navigation

An User Adaptive Navigation Metaphor to Connect and Rate the Coherence of Terms and Complex Objects (HH, JP, CK, HDK, PH), pp. 214–215.

ICDAR-1997-JingboXT #analysis #segmentation

Segmentation of Stick Text Based on Sub Connected Area Analysis (JG, XL, ZT), p. 417–?.

ICDAR-1997-ShinjoNKMSH #documentation

A method for connecting disappeared junction patterns on frame lines in form documents (HS, KN, MK, KM, YS, EH), pp. 667–670.

STOC-1997-KleinbergRT

Allocating Bandwidth for Bursty Connections (JMK, YR, ÉT), pp. 664–673.

KDD-1997-EsterKSX #database #detection #set

Density-Connected Sets and their Application for Trend Detection in Spatial Databases (ME, HPK, JS, XX), pp. 10–15.

POPL-1997-ChenH #linear #monad

Rolling Your Own MADT — A Connection Between Linear Types and Monads (CPC, PH), pp. 54–66.

SAC-1997-LiuLS #clustering #concurrent #multi #performance #thread

An efficient processor partitioning and thread mapping strategy for mesh-connected multiprocessor systems (HL, WML, YS), pp. 403–412.

HPCA-1997-RavindranS #comparison #multi #network #performance

A Performance Comparison of Hierarchical Ring- and Mesh-Connected Multiprocessor Networks (GR, MS), pp. 58–69.

CADE-1997-BaaderT #approach #problem #word

A New Approach for Combining Decision Procedure for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method (FB, CT), pp. 19–33.

CADE-1997-KreitzMOS #linear #logic #proving

Connection-Based Proof Construction in Linear Logic (CK, HM, JO, SS), pp. 207–221.

CSL-1997-Klarlund

Mona & Fido: The Logic-Automaton Connection in Practice (NK), pp. 311–326.

ICLP-1997-MullerW #concurrent #constraints

Connecting Propagators with a Concurrent Constraint Language (TM, JW), p. 412.

STOC-1996-CheriyanT #algorithm #performance

Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (Extended Abstract) (JC, RT), pp. 37–46.

ICPR-1996-BiancardiM #analysis #component #image #source code

Connected component support for image analysis programs (AB, AM), pp. 620–624.

ICPR-1996-MozefWJT #analysis #architecture #component #parallel

Parallel architecture dedicated to connected component analysis (EM, SW, JJ, ET), pp. 699–703.

KR-1996-Borgo #congruence

A Pointless Theory of Space Based on Strong Connection and Congruence (SB, NG, CM), pp. 220–229.

HPCA-1996-ReisnerW #parallel #protocol

A Cache Coherency Protocol for Optically Connected Parallel Computer Systems (JAR, TSW), pp. 222–231.

ICDAR-v1-1995-LeeL #network #recognition #segmentation

Integrated segmentation and recognition of connected handwritten characters with recurrent neural network (SWL, EJL), pp. 413–416.

ICDAR-v2-1995-HaHP #bound #component #recursion #using

Recursive X-Y cut using bounding boxes of connected components (JH, RMH, ITP), pp. 952–955.

ICDAR-v2-1995-SauvolaP #analysis #classification #feature model #performance #segmentation #using

Page segmentation and classification using fast feature extraction and connectivity analysis (JJS, MP), pp. 1127–1131.

ICDAR-v2-1995-Yu #automation #comprehension #diagrams

Automatic understanding of symbol-connected diagrams (BY), pp. 803–806.

STOC-1995-EdmondsP #bound

A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model (JE, CKP), pp. 147–156.

STOC-1995-GoldmannH

Monotone circuits for connectivity have depth (log n)2-o(1) (Extended Abstract) (MG, JH), pp. 569–574.

STOC-1995-KhullerR #algorithm #approximate #problem

Improved approximation algorithms for uniform connectivity problems (SK, BR), pp. 1–10.

ICALP-1995-NikoletseasRSY #graph #memory management #probability

Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time (SEN, JHR, PGS, MY), pp. 159–170.

ICALP-1995-Schwentick #graph #monad

Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree (TS), pp. 405–416.

TRI-Ada-1995-Ogren95a #case study #development #experience

Experiences from Trial Use of MIL-STD-498 in Connection with the O4S (Objects for Systems) Development Method (IÖ), pp. 773–789.

LOPSTR-1995-KreitzOS #development #proving

Guiding Program Development Systems by a Connection Based Proof Strategy (CK, JO, SS), pp. 137–151.

PPoPP-1995-BaderJ #algorithm #case study #component #image #parallel

Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study (Extended Abstract) (DAB, JJ), pp. 123–133.

SOSP-1995-MummertES #mobile

Exploiting Weak Connectivity for Mobile File Access (LBM, ME, MS), pp. 143–155.

SOSP-1995-TerryTPDSH

Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System (DBT, MT, KP, AJD, MS, CH), pp. 172–183.

EDAC-1994-FavalliDOR #fault #modelling

Modeling of Broken Connections Faults in CMOS ICs (MF, MD, PO, BR), pp. 159–164.

STOC-1994-DinitzV #graph #incremental #maintenance #set

The connectivity carcass of a vertex subset in a graph and its incremental maintenance (YD, AV), pp. 716–725.

ICALP-1994-Feige #algorithm #graph #performance #random

A Fast Randomized LOGSPACE Algorithm for Graph Connectivity (UF), pp. 499–507.

LFP-1994-DavisPS94a

Sweet Harmony: The Talk/C++ Connection (HD, PP, NS), pp. 121–127.

KR-1994-Gotts #how #using

How Far Can We “C”? Defining a “Doughnut” Using Connection Alone (NMG), pp. 246–257.

ICSE-1994-AllenG #architecture #formal method

Formalizing Architectural Connection (RJA, DG), pp. 71–80.

CC-1994-SlowikPP #compilation

Compiling Nested Loops for Limited Connectivity VLIWs (AS, GP, PP), pp. 143–157.

CADE-1994-Lysne #consistency #on the #proving

On the Connection between Narrowing and Proof by Consistency (OL), pp. 133–147.

DAC-1993-YuanPR #component #evaluation #logic #simulation

Evaluation of Parts by Mixed-Level DC-Connected Components in Logic Simulation (DCY, LTP, JTR), pp. 367–372.

ICDAR-1993-Fukushima #network #recognition

Connected character recognition with a neural network (KF), pp. 240–243.

ICDAR-1993-KrtolicaM #algorithm #recognition

Two-stage box connectivity algorithm for optical character recognition (RK, SM), pp. 179–182.

SIGMOD-1993-Tgieman #information management #network #research

The International Directory Network and Connected Data Information Systems for Research in the Earth and Space Sciences (JRT), pp. 475–478.

STOC-1993-ChouK #2d #complexity

Some complexity issues on the simply connected regions of the two-dimensional plane (AWC, KIK), pp. 1–10.

STOC-1993-CohenBKT #data type #query

Reinventing the wheel: an optimal data structure for connectivity queries (RFC, GDB, AK, RT), pp. 194–200.

STOC-1993-Edmonds #trade-off

Time-space trade-offs for undirected st-connectivity on a JAG (JE), pp. 718–727.

DAC-1992-ChungR #architecture #named

TEMPT: Technology Mapping for the Exploration of FPGA Architectures with Hard-Wired Connections (KC, JR), pp. 361–367.

SIGMOD-1992-Rosenthal #what

What Can We Do to Strengthen the Connection Between Theory and System Builders (AR), p. 101.

CHI-1992-Hill #constraints #paradigm #user interface #using

The abstraction-link-view paradigm: using constraints to connect user interfaces to applications (RDH), pp. 335–342.

KR-1992-CroccoL #logic #on the

On the Connection between Non-monotonic Inference Systems and Conditional Logics (GC, PL), pp. 565–571.

KR-1992-RandellCC #logic

A Spatial Logic based on Regions and Connection (DAR, ZC, AGC), pp. 165–176.

PLILP-1992-CousotC #abstract interpretation

Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation (PC, RC), pp. 269–295.

ICSE-1992-Beach #component #declarative

Connecting Software Components with Declarative Glue (BWB), pp. 120–137.

HPDC-1992-Oberbrunner #network #parallel #visualisation

Parallel Networking and Visualization on the Connection Machine CM-5 (GO), pp. 78–84.

DAC-1991-PangrleBLS #synthesis

Relevant Issues in High-Level Connectivity Synthesis (BMP, FB, DAL, AS), pp. 607–610.

PLDI-1991-BromleyHMS #compilation #fortran

Fortran at Ten Gigaflops: The Connection Machine Convolution Compiler (MB, SH, TSM, GLSJ), pp. 145–156.

STOC-1991-BarnesR #algorithm #polynomial #sublinear #using

Deterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space (Extended Abstract) (GB, WLR), pp. 43–53.

STOC-1991-CheriyanT #algorithm #parallel

Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates (Extended Abstract) (JC, RT), pp. 391–401.

STOC-1991-Gabow #approach

A Matroid Approach to Finding Edge Connectivity and Packing Arborescences (HNG), pp. 112–122.

STOC-1991-GalilI #algorithm #problem

Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract) (ZG, GFI), pp. 317–327.

WSA-1991-CousotC91a #abstract interpretation #comparison

Comparison of the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation (PC, RC), pp. 107–110.

SIGIR-1991-Swanson #analysis

Analysis of Unintended Connections Between Disjoint Science Literatures (DRS), pp. 280–289.

ICLP-1991-HentenryckD #constraints #logic #logic programming

The Cardinality Operator: A New Logical Connective for Constraint Logic Programming (PVH, YD), pp. 745–759.

IWPTS-1991-CorbiS #embedded #protocol #testing

Common Abstract Test Suite for the Connection Oriented Presentation Protocol Embedded Under Different Application Contexts (CC, GS), pp. 143–149.

DAC-1989-ChungC #parallel #simulation #using

Data Parallel Simulation Using Time-Warp on the Connection Machine (MJC, YC), pp. 98–103.

DAC-1989-GangulyP

Compaction of a Routed Channel on the Connection Machine (SG, VP), pp. 779–782.

DAC-1989-NarayananP #algorithm #fault #parallel #simulation

A Massively Parallel Algorithm for Fault Simulation on the Connection Machine (VN, VP), pp. 734–737.

DAC-1989-WooS #adaptation #functional

A Technology-adaptive Allocation of Functional Units and Connections (NSW, HS), pp. 602–605.

STOC-1989-BroderKRU

Trading Space for Time in Undirected s-t Connectivity (AZB, ARK, PR, EU), pp. 543–549.

STOC-1989-KochLMRR #network

Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract) (RRK, FTL, BMM, SR, ALR), pp. 227–240.

DAC-1988-Cai88a #layout

Connectivity Biased Channel Construction and Ordering for Building-Block Layout (HC), pp. 560–565.

DAC-1988-CarlsonR #verification

Mask Verification on the Connection Machine (ECC, RAR), pp. 134–140.

DAC-1988-Pangre #approach #heuristic #named

Splicer: A Heuristic Approach to Connectivity Binding (BMP), pp. 536–541.

DAC-1988-Papaspyrdis #prolog #verification

A Prolog-Based Connectivity Verification Tool (ACP), pp. 523–527.

STOC-1988-KarchmerW

Monotone Circuits for Connectivity Require Super-logarithmic Depth (MK, AW), pp. 539–550.

ICALP-1988-LingasS #algorithm #graph #morphism #polynomial

A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs (AL, MMS), pp. 394–409.

PPEALS-1988-AlbertKLS #array #compilation #fortran

Compiling Fortran 8x Array Features for the Connection Machine Computer System (EA, KK, JDL, GLSJ), pp. 42–56.

CSL-1988-Eder #calculus #comparison

A Comparison of the Resolution Caculus and the Connection Method, and a new Calculus Generalizing Both Methods (EE), pp. 80–98.

DAC-1987-WebberS #simulation

Circuit Simulation on the Connection Machine (DMW, ALSV), pp. 108–113.

PODS-1986-ChanA #on the

On the Properties and Characterization of Connection-tap-free Schemes (EPFC, PA), pp. 140–147.

STOC-1986-KosarajuA #array #simulation

Optimal Simulations between Mesh-Connected Arrays of Processors (Preliminary Version) (SRK, MJA), pp. 264–272.

STOC-1986-SchnorrS #algorithm #sorting

An Optimal Sorting Algorithm for Mesh Connected Computers (CPS, AS), pp. 255–263.

LFP-1986-Bawden #graph

Connection Graphs (AB), pp. 258–265.

LFP-1986-SteeleH #fine-grained #lisp #parallel

Connection Machine LISP: Fine-Grained Parallel Symbolic Processing (GLSJ, WDH), pp. 279–297.

CADE-1986-Andrews #higher-order #logic

Connections and Higher-Order Logic (PBA), pp. 1–4.

CADE-1986-LoganantharajM #graph #parallel #proving #theorem proving

Parallel Theorem Proving with Connection Graphs (RL, RAM), pp. 337–352.

PODS-1985-AusielloDM #concept #graph #modelling #semantics

Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models (GA, AD, MM), pp. 164–170.

STOC-1984-Miller #graph

Finding Small Simple Cycle Separators for 2-Connected Planar Graphs (GLM), pp. 376–382.

DAC-1983-Chuquillanqui #problem #scalability

Internal connection problem in large optimized PLAs (SC), pp. 795–802.

PODS-1983-GoodmanST83a #canonical #reduction

GYO Reductions, Canonical Connections, Tree and Cyclic Schemas and Tree Projections (NG, OS, YCT), pp. 267–278.

DAC-1982-TakashimaMCY #source code #verification

Programs for verifying circuit connectivity of mos/lsi mask artwork (MT, TM, TC, KY), pp. 544–550.

PODS-1982-MaierU

Connections in Acyclic Hypergraphs (DM, JDU), pp. 34–39.

SIGMOD-1982-MaierW #database #specification

Specifying Connections for a Universal Relation Scheme Database (DM, DSW), pp. 1–7.

STOC-1982-AtallahK #array #graph #problem

Graph Problems on a Mesh-Connected Processor Array (Preliminary Version) (MJA, SRK), pp. 345–353.

STOC-1980-KarpL #complexity

Some Connections between Nonuniform and Uniform Complexity Classes (RMK, RJL), pp. 302–309.

STOC-1980-KarpT #algorithm #linear #problem

Linear Expected-Time Algorithms for Connectivity Problems (Extended Abstract) (RMK, RET), pp. 368–377.

STOC-1979-DeMilloL #complexity #logic

Some Connections between Mathematical Logic and Complexity Theory (RAD, RJL), pp. 153–159.

STOC-1978-Tompa #trade-off #using

Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of their Circuits (MT), pp. 196–204.

ICALP-1978-Schnorr #multi #network #symmetry

Multiterminal Network Flow and Connectivity in Unsymmetrical Networks (CPS), pp. 425–439.

DAC-1977-AllgairE #approach #comparison

A comprehensive approach to a connectivity audit, or a fruitful comparison of apples and oranges (RMA, DSE), pp. 312–321.

DAC-1977-PedroG #algorithm #automation #design #named #set

DOCIL: An automatic system for printed circuit board (PCB) designing. A board description language and an algorithm to connect a set of points (TdP, RG), pp. 174–181.

VLDB-1977-Lipski #database #on the #semantics

On Semantic Issues Connected with Incomplete Information Data Bases (Abstract) (WLJ), p. 491.

STOC-1976-Hirschberg #algorithm #component #parallel #problem #transitive

Parallel Algorithms for the Transitive Closure and the Connected Component Problems (DSH), pp. 55–57.

STOC-1976-ThompsonK #parallel #sorting

Sorting on a Mesh-Connected Parallel Computer (CDT, HTK), pp. 58–64.

STOC-1974-Tarjan #graph #testing

Testing Graph Connectivity (RET), pp. 185–193.

DAC-1968-Heiss #algorithm #multi

A path connection algorithm for multi-layer boards (SH).