Stem subsequ$ (all stems)

46 papers:

LATA-2015-DaiW #algorithm #parallel #random #sequence

A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk (HKD, ZW), pp. 133–144.

SIGIR-2015-KostakisG #sequence

Subsequence Search in Event-Interval Sequences (OK, AG), pp. 851–854.

LATA-2014-BellaouarCZ #kernel #performance #sequence #string

Efficient List-Based Computation of the String Subsequence Kernel (SB, HC, DZ), pp. 138–148.

ICPR-2014-MatveevG #approximate #detection #segmentation

Iris Segmentation System Based on Approximate Feature Detection with Subsequent Refinements (IM, KG), pp. 1704–1709.

QoSA-2013-DuSHGV #generative #modelling #sequence

Generating service models by trace subsequence substitution (MD, JGS, CMH, JG, SV), pp. 123–132.

ICALP-v2-2013-CzerwinskiMM #performance #regular expression #sequence

Efficient Separability of Regular Languages by Subsequences and Suffixes (WC, WM, TM), pp. 150–161.

ICML-c3-2013-MineiroK

Loss-Proportional Subsampling for Subsequent ERM (PM, NK), pp. 522–530.

SIGMOD-2012-LiG #online #probability #sequence

Online windowed subsequence matching over probabilistic sequences (ZL, TG), pp. 277–288.

VLDB-2012-KotsifakosPHGAK #named #sequence

Hum-a-song: A Subsequence Matching with Gaps-Range-Tolerances Query-By-Humming System (AK, PP, JH, DG, VA, GK), pp. 1930–1933.

VLDB-2012-ZhuKA #effectiveness #framework #performance #retrieval #sequence

A Generic Framework for Efficient and Effective Subsequence Retrieval (HZ, GK, VA), pp. 1579–1590.

CIAA-2012-AmarniL #kernel #sequence

Factor and Subsequence Kernels and Signatures of Rational Languages (AA, SL), pp. 313–320.

ICPR-2012-KusumaSLL #recognition #sequence #using

Appearance-based object recognition using weighted longest increasing subsequence (GPK, AS, YL, JAL), pp. 3668–3671.

ICPR-2012-OnofriS #recognition #sequence #video

Combining video subsequences for human action recognition (LO, PS), pp. 597–600.

KDD-2012-RakthanmanonCMBWZZK #mining #sequence

Searching and mining trillions of time series subsequences under dynamic time warping (TR, BJLC, AM, GEAPAB, MBW, QZ, JZ, EJK), pp. 262–270.

SIGMOD-2011-HanLMHY #approach #sequence

A new approach for processing ranked subsequence matching based on ranked union (WSH, JL, YSM, SwH, HY), pp. 457–468.

VLDB-2011-KotsifakosPHG #framework #sequence

A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application (AK, PP, JH, DG), pp. 761–771.

LATA-2010-Arslan #algorithm #performance #sequence #string

A Fast Longest Common Subsequence Algorithm for Similar Strings (ANA), pp. 82–93.

HIMI-DIE-2009-NelsonV #self

Effects of a Mnemonic Technique on Subsequent Recall of Assigned and Self-generated Passwords (DN, KPLV), pp. 693–701.

SIGMOD-2008-AthitsosPPKG #approximate #sequence

Approximate embedding-based subsequence matching of time series (VA, PP, MP, GK, DG), pp. 365–378.

LATA-2008-Steinberg #matrix #sequence #theorem

Subsequence Counting, Matrix Representations and a Theorem of Eilenberg (BS), pp. 6–10.

VLDB-2007-HanLMJ #database #sequence

Ranked Subsequence Matching in Time-Series Databases (WSH, JL, YSM, HJ), pp. 423–434.

CIAA-2007-IliopoulosRVV #problem #sequence #string

The Constrained Longest Common Subsequence Problem for Degenerate Strings (CSI, MSR, MV, LV), pp. 309–311.

MLDM-2007-HanKK #performance #sequence #using

Efficient Subsequence Matching Using the Longest Common Subsequence with a Dual Match Index (TSH, SKK, JK), pp. 585–600.

CIKM-2006-GoldinMN #algorithm #clustering #distance #sequence

In search of meaning for time series subsequence clustering: matching algorithms based on a new distance measure (DQG, RM, GN), pp. 347–356.

SIGMOD-2005-WuSSJSK #sequence

Subsequence Matching on Structured Time Series Data (HW, BS, GCS, SBJ, HS, DRK), pp. 682–693.

SAC-2005-KimJ #performance #sequence

Performance bottleneck in time-series subsequence matching (SWK, BSJ), pp. 469–473.

SAC-2005-KimKS #database #optimisation #sequence

Optimization of subsequence matching under time warping in time-series databases (MSK, SWK, MS), pp. 581–586.

SIGMOD-2004-WuSZ #data type #online #sequence

Online Event-driven Subsequence Matching over Financial Data Streams (HW, BS, DZ), pp. 23–34.

CIAA-2003-MelicharP #approach #automaton #finite #problem #sequence

The Longest Common Subsequence Problem A Finite Automata Approach (BM, TP), pp. 294–296.

KDD-2003-SheCWEGB #predict

Frequent-subsequence-based prediction of outer membrane proteins (RS, FC, KW, ME, JLG, FSLB), pp. 436–445.

SIGMOD-2002-MoonWH #database #sequence

General match: a subsequence matching method in time-series databases based on generalized windows (YSM, KYW, WSH), pp. 382–393.

STOC-2002-Bachmat #analysis #scheduling #sequence

Average case analysis for batched disk scheduling and increasing subsequences (EB), pp. 277–286.

CIAA-2002-Tronicek #automaton #sequence

Common Subsequence Automaton (ZT), pp. 270–275.

ICALP-2002-Merkle #probability #sequence

The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences (WM), pp. 390–400.

SAC-2002-KimYPK #database #retrieval #sequence

Shape-based retrieval of similar subsequences in time-series databases (SWK, JY, SP, THK), pp. 438–445.

ICALP-2001-LinCJW #problem #sequence

The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations (GHL, ZZC, TJ, JW), pp. 444–455.

CIKM-2001-ParkKCP #approach #database #effectiveness #named #sequence

Prefix-Querying: An Approach for Effective Subsequence Matching Under Time Warping in Sequence Databases (SP, SWK, JSC, SP), pp. 255–262.

SAC-2001-ParkKC #approach #database #sequence

Segment-based approach for subsequence searches in sequence databases (SP, SWK, WWC), pp. 248–252.

DATE-2000-TangWT #evaluation #performance #sequence

Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation (XT, DFW, RT), pp. 106–111.

CIKM-2000-LohKW #approach #database #normalisation #sequence

Index Interpolation: An Approach to Subsequence Matching Supporting Normalization Transform in Time-Series Databases (WKL, SWK, KYW), pp. 480–487.

DAC-1999-PomeranzR #generative #sequence #testing

Built-In Test Sequence Generation for Synchronous Sequential Circuits Based on Loading and Expansion of Test Subsequences (IP, SMR), pp. 754–759.

PODS-1999-BoassonCGM #linear #problem #sequence

Window-Accumulated Subsequence Matching Problem is Linear (LB, PC, IG, YM), pp. 327–336.

KDD-1999-Oates #clustering #identification #multi #sequence

Identifying Distinctive Subsequences in Multivariate Time Series by Clustering (TO), pp. 322–326.

DATE-1998-HsiaoC #performance #sequence

State Relaxation Based Subsequence Removal for Fast Static Compaction in Sequential Circuits (MSH, STC), pp. 577–582.

SIGMOD-1994-FaloutsosRM #database #performance #sequence

Fast Subsequence Matching in Time-Series Databases (CF, MR, YM), pp. 419–429.

ICALP-1994-JiangL #approximate #on the #sequence

On the Approximation of Shortest Common Supersequences and Longest Common Subsequences (TJ, ML), pp. 191–202.