Stem lattic$ (all stems)

114 papers:

SAS-2015-CastelnuovoNRSY #analysis #bottom-up #case study #composition #top-down

Modularity in Lattices: A Case Study on the Correspondence Between Top-Down and Bottom-Up Analysis (GC, MN, NR, MS, HY), pp. 252–274.

STOC-2015-GorbunovVW #standard

Leveled Fully Homomorphic Signatures from Standard Lattices (SG, VV, DW), pp. 469–477.

DAC-2014-OderPG

Beyond ECDSA and RSA: Lattice-based Digital Signatures on Constrained Devices (TO, TP, TG), p. 6.

FoSSaCS-2014-AlmagorK #synthesis

Latticed-LTL Synthesis in the Presence of Noisy Inputs (SA, OK), pp. 226–241.

GT-VMT-2014-StuckrathW #adaptation #modelling #petri net #user interface

Lattice-extended Coloured Petri Net Rewriting for Adaptable User Interface Models (JS, BW).

ICPR-2014-MorenoS #simulation

Volume-Based Fabric Tensors through Lattice-Boltzmann Simulations (RM, ÖS), pp. 3179–3184.

SAS-2013-GangeNSSS #abstract domain #abstract interpretation

Abstract Interpretation over Non-lattice Abstract Domains (GG, JAN, PS, HS, PJS), pp. 6–24.

STOC-2013-CaputoMSS #algorithm #random

Random lattice triangulations: structure and algorithms (PC, FM, AS, AS), pp. 615–624.

CIAA-2013-GenetGLM #algorithm #automaton

A Completion Algorithm for Lattice Tree Automata (TG, TLG, AL, VM), pp. 134–145.

ICML-c2-2013-Rebagliati #clustering #fault #normalisation #strict

Strict Monotonicity of Sum of Squares Error and Normalized Cut in the Lattice of Clusterings (NR), pp. 163–171.

SAC-2013-NardelliTB #behaviour

Cross-lattice behavior of general ACO folding for proteins in the HP model (MN, LT, AB), pp. 1320–1327.

SAC-2013-SenatoreP #collaboration #concept analysis #fuzzy #navigation

Lattice navigation for collaborative filtering by means of (fuzzy) formal concept analysis (SS, GP), pp. 920–926.

ICALP-v2-2012-KufleitnerL #logic #word

Lattices of Logical Fragments over Words — (Extended Abstract) (MK, AL), pp. 275–286.

ICPR-2012-BoumaizaT #recognition

Impact of a codebook filtering step on a galois lattice structure for graphics recognition (AB, ST), pp. 278–281.

SEKE-2012-BhattiAHD #concept #re-engineering

A Catalog of Patterns for Concept Lattice Interpretation in Software Reengineering (MUB, NA, MH, SD), pp. 118–123.

ICDAR-2011-BoumaizaT #approach #novel #recognition #representation #word

A Novel Approach for Graphics Recognition Based on Galois Lattice and Bag of Words Representation (AB, ST), pp. 829–833.

ICDAR-2011-Saund #approach #graph #image #maintenance

A Graph Lattice Approach to Maintaining Dense Collections of Subgraphs as Image Features (ES), pp. 1069–1074.

ICDAR-2011-ZhangL #keyword #online

A Lattice-Based Method for Keyword Spotting in Online Chinese Handwriting (HZ, CLL), pp. 1064–1068.

FASE-2011-KelsenMG #complexity #modelling #using

Models within Models: Taming Model Complexity Using the Sub-model Lattice (PK, QM, CG), pp. 171–185.

FoSSaCS-2011-HalamishK #automaton

Minimizing Deterministic Lattice Automata (SH, OK), pp. 199–213.

PLDI-2011-KulkarniNPSP #commutative

Exploiting the commutativity lattice (MK, DN, DP, XS, KP), pp. 542–555.

DLT-2011-Yoshinaka #concept #context-free grammar #learning #towards

Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices (RY), pp. 429–440.

ICALP-v1-2011-ChengMS #graph

Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices (CTC, EM, IS), pp. 678–689.

SAC-2011-SunLZTCW #dependence #impact analysis #object-oriented #source code #using

Using lattice of class and method dependence for change impact analysis of object oriented programs (XS, BL, SZ, CT, XC, WW), pp. 1439–1444.

DAC-2010-AltunR

Lattice-based computation of Boolean functions (MA, MDR), pp. 609–612.

STOC-2010-MicciancioV #algorithm #exponential #problem

A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations (DM, PV), pp. 351–358.

DLT-2010-DrosteV #automaton #bound #logic #multi #theorem

Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices (MD, HV), pp. 160–172.

LATA-2010-KasprzikK #learning #string #using

String Extension Learning Using Lattices (AK, TK), pp. 380–391.

ICPR-2010-KhanWCKC #video

Lattice-Based Anomaly Rectification for Sport Video Annotation (AK, DW, TdC, JK, WJC), pp. 4372–4375.

ICPR-2010-Strand

Interpolation and Sampling on a Honeycomb Lattice (RS), pp. 2222–2225.

SEKE-2010-AbuzeidHT #algorithm #performance #reduction #testing

FLAT A Fast Lattice-Based Algorithm for Test Suite Reduction (ARA, HSH, IAHT), p. 67.

SEKE-2010-ShiNC

Lattice-Context Based Digital Paper Search (CS, ZN, XC), pp. 315–318.

WICSA-ECSA-2009-AboudAFHTUV #architecture #automation #classification #component #concept #using

Automated architectural component classification using concept lattices (NAA, GA, JRF, MH, CT, CU, SV), pp. 21–30.

DATE-2009-GarridoVSML #detection #implementation

Implementation of a reduced-lattice MIMO detector for OFDM Systems (JSG, HV, MS, DM, AL), pp. 1626–1631.

VLDB-2009-Karras #scalability

Optimality and Scalability in Lattice Histogram Construction (PK), pp. 670–681.

STOC-2009-Gentry #encryption #using

Fully homomorphic encryption using ideal lattices (CG), pp. 169–178.

ICALP-v2-2009-BrancoP #equation #polynomial #regular expression

Equations Defining the Polynomial Closure of a Lattice of Regular Languages (MJJB, JÉP), pp. 115–126.

CIKM-2009-DewriRRW #identification #named

POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice (RD, IR, IR, DW), pp. 1037–1046.

MoDELS-2009-LeungMLLSTL #ontology #scalability #semantics #using

Scalable Semantic Annotation Using Lattice-Based Ontologies (MKL, TM, EAL, EL, CPS, ST, BL), pp. 393–407.

MoDELS-2009-LeungMLLSTL #ontology #scalability #semantics #using

Scalable Semantic Annotation Using Lattice-Based Ontologies (MKL, TM, EAL, EL, CPS, ST, BL), pp. 393–407.

SAC-2009-ChenHKMM #adaptation #random testing #testing

Enhanced lattice-based adaptive random testing (TYC, DH, FCK, RGM, JM), pp. 422–429.

SAC-2009-WangDLL #performance #process

An efficient and accurate lattice for pricing derivatives under a jump-diffusion process (CJW, TSD, YDL, YCL), pp. 966–970.

STOC-2008-GamaN #difference

Finding short lattice vectors within mordell’s inequality (NG, PQN), pp. 207–216.

STOC-2008-GentryPV #encryption

Trapdoors for hard lattices and new cryptographic constructions (CG, CP, VV), pp. 197–206.

CIKM-2008-CandanCQS #summary

Table summarization with the help of domain lattices (KSC, HC, YQ, MLS), pp. 1473–1474.

ICPR-2008-Feschet

The lattice width and quasi-straightness in digital spaces (FF), pp. 1–4.

SIGIR-2008-ChiaSLN #approach #documentation #retrieval

A lattice-based approach to query-by-example spoken document retrieval (TKC, KCS, HL, HTN), pp. 363–370.

SAS-2007-GallJ #automaton #infinity #representation #verification

Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification (TLG, BJ), pp. 52–68.

STOC-2007-PeikertR #worst-case

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

KDD-2007-NijssenF #mining

Mining optimal decision trees from itemset lattices (SN, ÉF), pp. 530–539.

LCTES-2007-AliasBD #array #implementation #text-to-text

Bee+Cl@k: an implementation of lattice-based array contraction in the source-to-source translator rose (CA, FB, AD), pp. 73–82.

VMCAI-2007-KupfermanL #automaton

Lattice Automata (OK, YL), pp. 199–213.

STOC-2006-RegevR #problem

Lattice problems and norm embeddings (OR, RR), pp. 447–456.

ICPR-v4-2006-ZhengLZ #encryption #generative #using

Cryptographic Key Generation from Biometric Data Using Lattice Mapping (GZ, WL, CZ), pp. 513–516.

SEKE-2006-SartipiS #analysis #concept #evaluation #execution #mining

Application of Execution Pattern Mining and Concept Lattice Analysis on Software Structure Evaluation (KS, HS), pp. 302–308.

ASE-2005-Mayer #adaptation #random testing #testing

Lattice-based adaptive random testing (JM), pp. 333–336.

DAC-2005-McGeeN #classification #design #framework #pipes and filters

A lattice-based framework for the classification and design of asynchronous pipelines (PBM, SMN), pp. 491–496.

STOC-2005-Ajtai #representation

Representing hard lattices with O(n log n) bits (MA), pp. 94–103.

STOC-2005-Regev #encryption #fault #learning #linear #on the #random

On lattices, learning with errors, random linear codes, and cryptography (OR), pp. 84–93.

KDD-2005-ZaianeE #traversal

Pattern lattice traversal by selective jumps (ORZ, MEH), pp. 729–735.

ICLP-2005-Saidi #bound #mining #process #using

Using CLP to Characterise Linguistic Lattice Boundaries in a Text Mining Process (ASS), pp. 418–420.

CSMR-2004-Al-EkramK #composition #concept #slicing #source code #using

Source Code Modularization Using Lattice of Concept Slices (RAE, KK), pp. 195–203.

ICSM-2004-ZhaoZHMS #algorithm #feature model #scalability

Alternative Scalable Algorithms for Lattice-Based Feature Location (WZ, LZ, DH, HM, JS), p. 528.

STOC-2004-Ajtai #polynomial

A conjecture about polynomial time computable lattice-lattice functions (MA), pp. 486–493.

ICGT-2004-Casas-GarrigaB #partial order

Coproduct Transformations on Lattices of Closed Partial Orders (GCG, JLB), pp. 336–351.

SEKE-2004-LiLCWL #using

Extracting Minimal Non-Redundant Implication Rules by Using Quantized Closed Itemset Lattice (YL, ZL, WC, QW, WL), pp. 402–405.

WCRE-2003-DekelG #concept

Revealing Class Structure with Concept Lattices (UD, JYG), pp. 353–365.

STOC-2003-Ajtai #algorithm #approximate #behaviour #worst-case

The worst-case behavior of schnorr’s algorithm approximating the shortest nonzero vector in a lattice (MA), pp. 396–406.

STOC-2003-Regev #encryption

New lattice based cryptographic constructions (OR), pp. 407–416.

CIKM-2003-MayfieldMPP #using

Lattice-based tagging using support vector machines (JM, PM, CDP, CP), pp. 303–308.

ICGT-2002-Pfaltz #effectiveness #incremental #information management

Incremental Transformation of Lattices: A Key to Effective Knowledge Discovery (JLP), pp. 351–362.

KR-2002-BerN #comparison #design

Design and Comparison of Lattices of Topological Relations Based on Galois Lattice Theory (FLB, AN), pp. 37–48.

SAC-2002-MartinezL #database #image

Browsing image databases with Galois’ lattices (JMM, EL), pp. 791–795.

RTA-2002-Struth #calculus

Deriving Focused Lattice Calculi (GS), pp. 83–97.

VMCAI-2002-MurawskiY #analysis

Static Monotonicity Analysis for lambda-definable Functions over Lattices (ASM, KY), pp. 139–153.

DAC-2001-ZhouSN #analysis #fixpoint

Timing Analysis with Crosstalk as Fixpoints on Complete Lattice (HZ, NVS, WN), pp. 714–719.

STOC-2001-AjtaiKS #algorithm #problem

A sieve algorithm for the shortest lattice vector problem (MA, RK, DS), pp. 601–610.

CIAA-2001-MoreySMW #automaton

Crystal Lattice Automata (JM, KS, REM, MWW), pp. 214–220.

CIKM-2001-PollyW #feature model #pattern matching #performance #robust

Efficient and Robust Feature Extraction and Pattern Matching of Time Series by a Lattice Structure (WPMP, MHW), pp. 271–278.

PODS-2000-MorishitaS #metric #statistics #traversal

Traversing Itemset Lattice with Statistical Metric Pruning (SM, JS), pp. 226–236.

CSMR-2000-Snelting #concept #re-engineering

Software Reengineering Based on Concept Lattices (GS), pp. 3–10.

ICALP-2000-Blomer

Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices (JB), pp. 248–259.

CADE-2000-Sofronie-Stokkermans #on the #unification

On Unification for Bonded Distributive Lattices (VSS), pp. 465–481.

STOC-1999-BlomerS #complexity #independence #on the

On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice (JB, JPS), pp. 711–720.

FLOPS-1999-FernandezH #constraints #framework #theorem proving

An Interval Lattice-Based Constraint Solving Framework for Lattices (AJF, PMH), pp. 194–208.

CADE-1999-Sofronie-Stokkermans #complexity #decidability #on the

On the Universal Theory of Varieties of Distributive Lattices with Operators: Some Decidability and Complexity Results (VSS), pp. 157–171.

STOC-1998-GoldreichG #on the #problem

On the Limits of Non-Approximability of Lattice Problems (OG, SG), pp. 1–9.

ICML-1998-LiquiereS #graph #machine learning

Structural Machine Learning with Galois Lattice and Graphs (ML, JS), pp. 305–313.

STOC-1997-KannanV

Sampling Lattice Points (RK, SV), pp. 696–700.

SAC-1997-TheobaldWB #concept #design #matrix

Design concepts for matrices and lattices in LiDIA (PT, SW, WB), pp. 532–536.

LICS-1997-Janin #automaton #calculus #fixpoint #reduction #theorem

Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices (DJ), pp. 172–182.

RTA-1997-Struth #for free #on the #problem #word

On the Word Problem for Free Lattices (GS), pp. 128–141.

STOC-1996-Ajtai #generative #problem

Generating Hard Instances of Lattice Problems (Extended Abstract) (MA), pp. 99–108.

CADE-1996-Salzer #axiom #multi #quantifier

Optimal Axiomatizations for Multiple-Valued Operators and Quantifiers Based on Semi-lattices (GS), pp. 688–702.

ICDAR-1993-HongH #parsing #probability #recognition

Text recognition enhancement with a probabilistic lattice chart parser (TH, JJH), pp. 222–225.

STOC-1993-KenyonRS #graph

Matchings in lattice graphs (CK, DR, AS), pp. 738–746.

SIGIR-1993-Pedersen #information retrieval

A Browser for Bibliographic Information Retrieval, Based on an Application of Lattice Theory (GSP), pp. 270–279.

OOPSLA-1993-GodinM #maintenance #using

Building and Maintaining Analysis-Level Class Hierarchies Using Galois Lattices (RG, HM), pp. 394–410.

PLILP-1993-ClarkH #graph

A Lattice of Abstract Graphs (DC, CH), pp. 318–331.

HPDC-1992-BetelloRSR #clustering

Lattice Boltzmann Method on a Cluster of IBM RISC System/6000 Workstations (GB, GR, SS, FR), pp. 242–247.

SEKE-1990-EichmannA #classification #design

Design of a Lattice-Based Faceted Classification System (DE, JA), pp. 90–97.

CAV-1990-BuyM #liveness #proving

A Proof Lattice-Based Technique for Analyzing Liveness of Resource Controllers (UAB, RM), pp. 292–301.

CADE-1988-McCune #challenge #problem #similarity

Challenge Equality Problems in Lattice Theory (WM), pp. 704–709.

LICS-1988-Bloom #modelling #λ-calculus

Can LCF Be Topped? Flat Lattice models of Typed λ Calculus (Preliminary Report) (BB), pp. 282–295.

ICALP-1987-PazS #approximate #integer

Approximating Integer Lattices by Lattices with Cyclic Factor Groups (AP, CPS), pp. 386–393.

FPCA-1987-MartinH #finite #fixpoint

Finding fixed points in finite lattices (CM, CH), pp. 426–445.

ICALP-1986-Schnorr #algorithm #performance #reduction

A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract) (CPS), pp. 359–369.

ICALP-1985-Hrbacek #algebra

Powerdomains as Algebraic Lattices (Preliminary Report) (KH), pp. 281–289.

STOC-1983-Kannan #algorithm #integer #problem #programming

Improved Algorithms for Integer Programming and Related Lattice Problems (RK), pp. 193–206.

ICALP-1982-GoralcikovaGK #bound #morphism #pseudo

A Boundary of Isomorphism Completeness in the Lattice of Semigroup Pseudovarieties (AG, PG, VK), pp. 292–299.

SIGIR-1979-Mazlack #comparison #database #empirical

An Empirical Comparison: Tree and Lattice Structures for Symbolic Data Bases (LJM), pp. 33–40.

POPL-1977-CousotC #abstract interpretation #approximate #fixpoint #source code #static analysis

Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints (PC, RC), pp. 238–252.

SOSP-J-1975-Denning76 #data flow

A Lattice Model of Secure Information Flow (DED), pp. 236–243.

POPL-1975-FongKU #algebra #optimisation

Application of Lattice Algebra to Loop Optimization (ACF, JBK, JDU), pp. 1–9.