Stem span$ (all stems)

80 papers:

SIGMOD-2015-HuangFL #graph

Minimum Spanning Trees in Temporal Graphs (SH, AWCF, RL), pp. 419–430.

BX-2015-JohnsonR #lens

Spans of Delta Lenses (MJ, RR), pp. 1–15.

BX-2015-JohnsonRa #monad

Distributing Commas, and the Monad of Anchored Spans (MJ, RR), pp. 31–42.

HT-2014-KoidlCW #independence #personalisation

Cross-site personalization: assisting users in addressing information needs that span independently hosted websites (KK, OC, VW), pp. 66–76.

CIAA-2014-Fujiyoshi #automaton #multi #recognition

Recognition of Labeled Multidigraphs by Spanning Tree Automata (AF), pp. 188–199.

ICALP-v2-2014-AschnerK #bound #constraints #modelling #network

Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints (RA, MJK), pp. 387–398.

BX-2014-JohnsonR #lens

Spans of lenses (MJ, RDR), pp. 112–118.

ICALP-v2-2013-HenzingerKN #maintenance #network

Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks (MH, SK, DN), pp. 607–619.

PPDP-2013-LamoMRL #approach #bidirectional #declarative #graph #model transformation

A declarative and bidirectional model transformation approach based on graph co-spans (YL, FM, AR, JdL), pp. 1–12.

SOSP-2013-WuBPKM #effectiveness #multi #named

SPANStore: cost-effective geo-replicated storage spanning multiple cloud services (ZW, MB, DP, EKB, HVM), pp. 292–308.

CASE-2012-FrankHEFDV #automation #modelling #realtime #requirements #using

Using contact points to integrate discipline spanning real-time requirements in modeling Networked Automation Systems for manufacturing systems (TF, TH, KE, AF, CD, BVH), pp. 851–856.

SIGMOD-2012-ZhuLZZY #named #similarity

TreeSpan: efficiently computing similarity all-matching (GZ, XL, KZ, WZ, JXY), pp. 529–540.

STOC-2012-AbrahamN #using

Using petal-decompositions to build a low stretch spanning tree (IA, ON), pp. 395–406.

STOC-2012-Belovs #source code

Span programs for functions with constant-sized 1-certificates: extended abstract (AB), pp. 77–84.

ICALP-v1-2012-GeorgiadisT #independence #order

Dominators, Directed Bipolar Orders, and Independent Spanning Trees (LG, RET), pp. 375–386.

ICGT-2012-Lowe #algebra #framework #graph grammar #graph transformation

Refined Graph Rewriting in Span-Categories — A Framework for Algebraic Graph Transformation (ML), pp. 111–125.

KDD-2012-ChanLLBR #graph #mining #multi #named

SeqiBloc: mining multi-time spanning blockmodels in dynamic graphs (JC, WL, CL, JB, KR), pp. 651–659.

KDD-2012-YinZC #algorithm #mining #named #performance

USpan: an efficient algorithm for mining high utility sequential patterns (JY, ZZ, LC), pp. 660–668.

PPoPP-2012-NobariCKB #parallel #scalability

Scalable parallel minimum spanning forest computation (SN, TTC, PK, SB), pp. 205–214.

ICALP-v1-2011-DingX #clustering #problem

Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere (HD, JX), pp. 773–784.

CIKM-2011-BykauMRV #evolution #query #using

Supporting queries spanning across phases of evolving artifacts using Steiner forests (SB, JM, FR, YV), pp. 1649–1658.

SAC-2011-KienHB #algorithm #communication #hybrid #problem #search-based

New hybrid genetic algorithm for solving optimal communication spanning tree problem (PTK, NDH, HTTB), pp. 1076–1081.

ICGT-2010-Lowe #graph grammar

Graph Rewriting in Span-Categories (ML), pp. 218–233.

ICML-2010-Cesa-BianchiGVZ #graph #predict #random

Random Spanning Trees and the Prediction of Weighted Graphs (NCB, CG, FV, GZ), pp. 175–182.

KDD-2010-MarchRG #algorithm #analysis #performance

Fast euclidean minimum spanning tree: algorithm, analysis, and applications (WBM, PR, AGG), pp. 603–612.

SIGIR-2010-SvoreKK #how #proximity #retrieval #web

How good is a span of terms?: exploiting proximity to improve web retrieval (KMS, PHK, NK), pp. 154–161.

SAC-2010-DolevT #distributed #named

Spanders: distributed spanning expanders (SD, NT), pp. 1309–1314.

CIAA-2009-Fujiyoshi #automaton #graph #recognition

Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata (AF), pp. 105–114.

HCI-VAD-2009-KandoganHBM #collaboration #risk management

Studying Reactive, Risky, Complex, Long-Spanning, and Collaborative Work: The Case of IT Service Delivery (EK, EMH, JHB, PPM), pp. 504–513.

PPoPP-2009-KangB #algorithm #graph #memory management #performance #transaction

An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs (SK, DAB), pp. 15–24.

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.

STOC-2008-ReichardtS #algorithm #quantum

Span-program-based quantum algorithm for evaluating formulas (BR, RS), pp. 103–112.

STOC-2007-SinghL #approximate #bound

Approximating minimum bounded degree spanning trees to within one of optimal (MS, LCL), pp. 661–670.

ICALP-2007-BergerG #graph

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

CIKM-2006-XuWFSP #classification #correlation #data type

Classification spanning correlated data streams (YX, KW, AWCF, RS, JP), pp. 132–141.

ICPR-v3-2006-QiuH #graph #using

Graph Matching using Commute Time Spanning Trees (HQ, ERH), pp. 1224–1227.

ICPR-v4-2006-QiuH06a #graph #using

Graph Matching using Commute Time Spanning Tr (HQ, ERH), p. 955.

ICDAR-2005-LongDC #detection #documentation

A Model for Detecting and Merging Vertically Spanned Table Cells in Plain Text Documents (VL, RD, SC), pp. 1242–1246.

STOC-2005-ElkinEST

Lower-stretch spanning trees (ME, YE, DAS, SHT), pp. 494–503.

ICML-2005-PoczosL #analysis #independence #using

Independent subspace analysis using geodesic spanning trees (BP, AL), pp. 673–680.

STOC-2004-CzumajS #metric

Estimating the weight of metric minimum spanning trees in sublinear-time (AC, CS), pp. 175–183.

STOC-2004-Elkin #approximate #bound #distributed #problem #trade-off

Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (ME), pp. 331–340.

ICALP-2004-JothiR #algorithm #approximate #design #network #problem

Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design (RJ, BR), pp. 805–818.

KDD-2004-ChengYH #database #incremental #mining #named #scalability

IncSpan: incremental mining of sequential patterns in large database (HC, XY, JH), pp. 527–532.

SAC-2004-RahmaniK #graph #strict

Degree restricted spanning trees of graphs (MSR, AK), pp. 225–228.

ICALP-2003-GarganoH #graph #how

There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them) (LG, MH), pp. 802–816.

SAC-2003-HareJ #algorithm #problem #search-based

A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles (RMH, BAJ), pp. 725–729.

SAC-2003-RaidlJ #algorithm #bound #heuristic #problem

Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem (GRR, BAJ), pp. 747–752.

ICALP-2002-GarganoHSV #bound #branch

Spanning Trees with Bounded Number of Branch Vertices (LG, PH, LS, UV), pp. 355–365.

ICPR-v4-2002-JainXHX #testing #using

Uniformity Testing Using Minimal Spanning Tree (AKJ, XX, TKH, FX), pp. 281–284.

SAC-2002-JulstromR #algorithm #robust #set

Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges (BAJ, GRR), pp. 547–552.

ICALP-2001-ChazelleRT #approximate #sublinear

Approximating the Minimum Spanning Tree Weight in Sublinear Time (BC, RR, LT), pp. 190–200.

STOC-2000-KonemannR #algorithm #approximate #bound #matter

A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees (JK, RR), pp. 537–546.

ICALP-2000-PettieR #algorithm

An Optimal Minimum Spanning Tree Algorithm (SP, VR), pp. 49–60.

KDD-2000-HanPMCDH #mining #named

FreeSpan: frequent pattern-projected sequential pattern mining (JH, JP, BMA, QC, UD, MH), pp. 355–359.

SAC-2000-RaidlJ #algorithm #problem #search-based

A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem (GRR, BAJ), pp. 440–445.

DATE-1999-NoethK #encoding #power management

Spanning Tree-based State Encoding for Low Power Dissipation (WN, RK), pp. 168–174.

STOC-1998-Gal #bound #source code

A Characterization of Span Program Size and Improved Lower Bounds for Monotone Span Programs (AG), pp. 429–437.

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-Peleg #distributed

Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees (DP), pp. 164–175.

ICALP-1998-PelegR #approximate #communication

Deterministic Polylog Approximation for Minimum Communication Spanning Trees (DP, ER), pp. 670–681.

ICALP-1997-HenzingerK #graph #maintenance

Maintaining Minimum Spanning Trees in Dynamic Graphs (MRH, VK), pp. 594–604.

ICALP-1997-KrumkeMNRRSW

Improving Spanning Trees by Upgrading Nodes (SOK, MVM, HN, RR, SSR, RS, HCW), pp. 281–291.

STOC-1996-BabaiGKRSW #bound #graph #source code

Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs (LB, AG, JK, LR, TS, AW), pp. 603–611.

STOC-1996-Wilson #generative #random

Generating Random Spanning Trees More Quickly than the Cover Time (DBW), pp. 296–303.

ICPR-1996-Marchand-MailletS #analysis #approach #image

A minimum spanning tree approach to line image analysis (SMM, YMS), pp. 225–230.

SAC-1995-AbualiWS #encoding #graph #representation

Determinant factorization and cycle basis: encoding schemes for the representation of spanning trees on incomplete graphs (FNA, RLW, DAS), pp. 305–312.

HPDC-1995-JacobL #algorithm #performance #recursion #refinement

A Spanning Tree Based Recursive Refinement Algorithm for Fast Task Mapping (JCJ, SYL), pp. 58–65.

STOC-1994-GargH #algorithm #approximate #problem

An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane (NG, DSH), pp. 432–438.

STOC-1994-KhullerRY

Low degree spanning trees of small weight (SK, BR, NEY), pp. 412–421.

STOC-1994-KleinT #algorithm #linear #random

A randomized linear-time algorithm for finding minimum spanning trees (PNK, RET), pp. 9–15.

ICALP-1994-ItalianoR #maintenance

Maintaining Spanning Trees of Small Diameter (GFI, RR), pp. 227–238.

SAC-1994-AbualiSW #algorithm #design #network #probability #search-based #using

Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees (FNA, DAS, RLW), pp. 242–246.

DAC-1987-GranackiP #interface #named #natural language #specification

PHRAN-SPAN: A Natural Language Interface for System Specifications (JJGJ, ACP), pp. 416–422.

STOC-1987-Awerbuch #algorithm #distributed #problem #summary

Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems (Detailed Summary) (BA), pp. 230–240.

ICALP-1986-VarmanD #algorithm #parallel

A Parallel Vertex Insertion Algorithm For Minimum Spanning Trees (PJV, KD), pp. 424–433.

STOC-1984-Clarkson #algorithm #approximate #geometry #performance

Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract) (KLC), pp. 342–348.

STOC-1984-Post

Minimum Spanning Ellipsoids (MJP), pp. 108–116.

STOC-1983-Frederickson #data type #online

Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version) (GNF), pp. 252–257.

ICALP-1979-PapadimitriouY #complexity #problem #strict

The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract) (CHP, MY), pp. 460–470.