Stem quasi$ (all stems)

102 papers:

DATE-2015-AfacanBPDB #hybrid #monte carlo

A hybrid Quasi Monte Carlo method for yield aware analog circuit sizing tool (EA, GB, AEP, GD, IFB), pp. 1225–1228.

LATA-2015-AmanoS #bound #multi #polynomial

A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP (KA, AS), pp. 461–472.

ICML-2015-GongY #analysis #convergence #memory management

A Modified Orthant-Wise Limited Memory Quasi-Newton Method with Convergence Analysis (PG, JY), pp. 276–284.

ICST-2015-BardinDDKPTM #detection #requirements

Sound and Quasi-Complete Detection of Infeasible Test Requirements (SB, MD, RD, NK, MP, YLT, JYM), pp. 1–10.

DAC-2014-ChuangLJ #hybrid #synthesis

Synthesis of PCHB-WCHB Hybrid Quasi-Delay Insensitive Circuits (CCC, YHL, JHRJ), p. 6.

TACAS-2014-HerreraWP #network #query #reduction

Quasi-Equal Clock Reduction: More Networks, More Queries (CH, BW, AP), pp. 295–309.

LATA-2014-CaronFM

(k, l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization (PC, MF, LM), pp. 260–272.

ICML-c1-2014-YangSAM #invariant #kernel #monte carlo

Quasi-Monte Carlo Feature Maps for Shift-Invariant Kernels (JY, VS, HA, MWM), pp. 485–493.

ICML-c2-2014-CarlssonMRS #clustering #network #symmetry

Hierarchical Quasi-Clustering Methods for Asymmetric Networks (GEC, FM, AR, SS), pp. 352–360.

ICML-c2-2014-Sohl-DicksteinPG #optimisation #performance #probability #scalability

Fast large-scale optimization by unifying stochastic gradient and quasi-Newton methods (JSD, BP, SG), pp. 604–612.

POPL-2014-KuperTKN #parallel #programming

Freeze after writing: quasi-deterministic parallel programming with LVars (LK, AT, NRK, RRN), pp. 257–270.

ASE-2013-ZhangCW #concurrent #data type #named #runtime

Round-up: Runtime checking quasi linearizability of concurrent data structures (LZ, AC, CW), pp. 4–14.

CSMR-2013-Przybylek #aspect-oriented

Quasi-controlled Experimentations on the Impact of AOP on Software Comprehensibility (AP), pp. 253–262.

STOC-2013-AgrawalSS

Quasi-polynomial hitting-set for set-depth-Δ formulas (MA, CS, NS), pp. 321–330.

CIAA-J-2012-Berlinkov13 #automaton #clustering

Synchronizing quasi-Eulerian and quasi-One-Cluster Automata (MVB), pp. 729–746.

ICALP-v1-2013-LeviR #graph

A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor (RL, DR), pp. 709–720.

ICALP-v2-2013-Woods #generative

Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials (KW), pp. 410–421.

KDD-2013-TsourakakisBGGT #clique #quality

Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees (CET, FB, AG, FG, MAT), pp. 104–112.

CIAA-2012-Berlinkov #automaton

Synchronizing Automata on Quasi-Eulerian Digraph (MVB), pp. 90–100.

ICALP-v1-2012-PolacekS #strict

Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation (LP, OS), pp. 726–737.

ICML-2012-HennigK

Quasi-Newton Methods: A New Direction (PH, MK), p. 134.

HPCA-2012-PanDWZ #enterprise #memory management #performance

Quasi-nonvolatile SSD: Trading flash memory nonvolatility to improve storage system performance for enterprise applications (YP, GD, QW, TZ), pp. 179–188.

TACAS-2011-ChatterjeeHJS #named #synthesis

QUASY: Quantitative Synthesis Tool (KC, TAH, BJ, RS), pp. 267–271.

STOC-2011-NovocinSV #algorithm #complexity

An LLL-reduction algorithm with quasi-linear time complexity: extended abstract (AN, DS, GV), pp. 403–412.

LATA-2011-PolicritiT #finite #set

Well-Quasi-Ordering Hereditarily Finite Sets (AP, AIT), pp. 440–451.

CIKM-2011-ParkCS #dependence #information retrieval

A quasi-synchronous dependence model for information retrieval (JHP, WBC, DAS), pp. 17–26.

DATE-2010-MaricauG #complexity #reliability #simulation #variability

Variability-aware reliability simulation of mixed-signal ICs with quasi-linear complexity (EM, GGEG), pp. 1094–1099.

STOC-2010-Varadarajan #geometry #set

Weighted geometric set cover via quasi-uniform sampling (KRV), pp. 641–648.

CHI-2010-BiSZ #optimisation

Quasi-qwerty soft keyboard optimization (XB, BAS, SZ), pp. 283–286.

CIKM-2010-ShiXF

Anonymizing data with quasi-sensitive attribute values (PS, LX, BCMF), pp. 1389–1392.

ICPR-2010-CadavidA #automation #detection #modelling #using #visual notation

Exploiting Visual Quasi-periodicity for Automated Chewing Event Detection Using Active Appearance Models and Support Vector Machines (SC, MAM), pp. 1714–1717.

ICPR-2010-KoskenkorvaKB

Quasi-dense Wide Baseline Matching for Three Views (PK, JK, SSB), pp. 806–809.

DATE-2009-ChenKLA

Accelerating FPGA-based emulation of quasi-cyclic LDPC codes with vector processing (XC, JK, SL, VA), pp. 1530–1535.

DLT-2008-DAlessandroV #formal method

Well Quasi-orders in Formal Language Theory (FD, SV), pp. 84–95.

ICML-2008-YuVGS #approach #optimisation

A quasi-Newton approach to non-smooth convex optimization (JY, SVNV, SG, NNS), pp. 1216–1223.

ICPR-2008-Feschet

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

ICPR-2008-FusielloI

Quasi-Euclidean uncalibrated epipolar rectification (AF, LI), pp. 1–4.

ICPR-2008-SrihariNNL #clique #detection #network

Detecting hubs and quasi cliques in scale-free networks (SS, HKN, KN, HWL), pp. 1–4.

ICPR-2008-WangWH #matrix

Structure and motion factorization under quasi-perspective projection with missing data in tracking matrix (GW, QMJW, WH), pp. 1–4.

KDD-2008-JensenFTM #automation #design #identification

Automatic identification of quasi-experimental designs for discovering causal knowledge (DDJ, ASF, BJT, MEM), pp. 372–380.

PPoPP-2008-NavabiZJ #scheduling

Quasi-static scheduling for safe futures (AN, XZ, SJ), pp. 23–32.

PODS-2007-FaginKPT

Quasi-inverses of schema mappings (RF, PGK, LP, WCT), pp. 123–132.

PEPM-2007-Vidal #logic programming #partial evaluation #source code #termination

Quasi-terminating logic programs for ensuring the termination of partial evaluation (GV), pp. 51–60.

CIAA-2007-SteinbyT #morphism

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms (MS, CIT), pp. 265–276.

ICALP-2007-AlonCHKRS #algorithm #graph

Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions (NA, ACO, HH, MK, VR, MS), pp. 789–800.

RTA-2007-ZantemaW #termination

Termination by Quasi-periodic Interpretations (HZ, JW), pp. 404–418.

STOC-2006-BansalCES #graph

A quasi-PTAS for unsplittable flow on line graphs (NB, AC, AE, BS), pp. 721–729.

STOC-2006-RemyS #approximate

A quasi-polynomial time approximation scheme for minimum weight triangulation (JR, AS), pp. 316–325.

DLT-2006-DAlessandroRV #finite #order #set

Well Quasi Orders and the Shuffle Closure of Finite Sets (FD, GR, SV), pp. 260–269.

ICPR-v1-2006-TavakkoliNB #detection #learning #recursion #robust

Robust Recursive Learning for Foreground Region Detection in Videos with Quasi-Stationary Backgrounds (AT, MN, GB), pp. 315–318.

KDD-2006-ZengWZK #clique #database #graph #scalability

Coherent closed quasi-clique discovery from large dense graph databases (ZZ, JW, LZ, GK), pp. 797–802.

HPCA-2006-VenkatesanHR #agile

Retention-aware placement in DRAM (RAPID): software methods for quasi-non-volatile DRAM (RKV, SH, ER), pp. 155–165.

ASE-2005-ChenM #random testing #testing

Quasi-random testing (TYC, RGM), pp. 309–312.

DAC-2005-CortesEP #energy #realtime

Quasi-static assignment of voltages and optional cycles for maximizing rewards in real-time systems with energy c-onstraints (LAC, PE, ZP), pp. 889–894.

DAC-2005-SouMD #approach #optimisation #order #reduction

A quasi-convex optimization approach to parameterized model order reduction (KCS, AM, LD), pp. 933–938.

DATE-2005-AndreiSEPH #constraints #energy #scalability

Quasi-Static Voltage Scaling for Energy Minimization with Time Constraints (AA, MTS, PE, ZP, BMAH), pp. 514–519.

DATE-2005-BouesseRDG #formal method

DPA on Quasi Delay Insensitive Asynchronous Circuits: Formalization and Improvement (GFB, MR, SD, FG), pp. 424–429.

KDD-2005-PeiJZ #clique #mining #on the

On mining cross-graph quasi-cliques (JP, DJ, AZ), pp. 228–238.

RTA-2005-BonfanteMM #bound

Quasi-interpretations and Small Space Bounds (GB, JYM, JYM), pp. 150–164.

RTA-2005-DershowitzE #order

Leanest Quasi-orderings (ND, ECE), pp. 32–45.

VMCAI-2005-Bertrane #abstract interpretation #composition #source code #static analysis

Static Analysis by Abstract Interpretation of the Quasi-synchronous Composition of Synchronous Programs (JB), pp. 97–112.

DATE-v2-2004-CortesEP #realtime #scheduling

Quasi-Static Scheduling for Real-Time Systems with Hard and Soft Tasks (LAC, PE, ZP), pp. 1176–1183.

DLT-2004-DAlessandroV #set

Avoidable Sets and Well Quasi-Orders (FD, SV), pp. 139–150.

ICALP-2004-Kunc

Regular Solutions of Language Inequalities and Well Quasi-orders (MK), pp. 870–881.

DATE-2003-LomenaLWK #approach #explosion #performance #scheduling

An Efficient Hash Table Based Approach to Avoid State Space Explosion in History Driven Quasi-Static Scheduling (AGL, MLLV, YW, AK), pp. 10428–10435.

DLT-2003-DAlessandroV #on the

On Well Quasi-orders on Languages (FD, SV), pp. 230–241.

CGO-2003-SpadiniFPL

Improving Quasi-Dynamic Schedules through Region Slip (FS, BF, SJP, SSL), pp. 149–158.

TLCA-2003-Amadio

Max-Plus Quasi-interpretations (RMA), pp. 31–45.

DATE-2002-ArrigoniDPLW #scheduling

False Path Elimination in Quasi-Static Scheduling (GA, LD, CP, LL, YW), pp. 964–970.

ICPR-v1-2002-NiimiNKE #image

Luminance Quasi-Preserving Color Quantization for Digital Steganography to Palette-Based Images (MN, HN, EK, ROE), pp. 252–254.

ICPR-v1-2002-ParameswaranC #invariant #recognition #representation

Quasi-Invariants for Human Action Representation and Recognition (VP, RC), pp. 307–310.

ICPR-v2-2002-Bartoli #framework

A Unified Framework for Quasi-Linear Bundle Adjustment (AB), pp. 560–563.

ICPR-v3-2002-SandersNS #formal method

A Theory of the Quasi-Static World (BCSS, RCN, RS), pp. 1–6.

ECOOP-2002-Filman #encoding

Polychotomic Encoding: A Better Quasi-Optimal Bit-Vector Encoding of Tree Hierarchies (REF), pp. 545–561.

ECOOP-2001-RaynaudT #encoding #performance #testing

A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests (OR, ET), pp. 165–180.

OOPSLA-2000-SerranoBMG #compilation #java #named

Quicksilver: a quasi-static compiler for Java (MJS, RB, SPM, MG), pp. 66–82.

DAC-1999-FengPNKW #approach #performance

Efficient Computation of Quasi-Periodic Circuit Operating Conditions via a Mixed Frequency/Time Approach (DF, JRP, KN, KSK, JW), pp. 635–640.

STOC-1999-CaiNS #probability #theorem

Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time (JyC, AN, DS), pp. 726–735.

FLOPS-1999-Ohlebusch #on the #term rewriting

On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems (EO), pp. 179–193.

HCI-CCAD-1999-Swezey #metric #performance #problem #simulation

Measurement of team problem solving performance via a computerized quasi-experimental simulation (RWS), pp. 482–486.

CIKM-1999-ShyuCK #database

Discovering Quasi-Equivalence Relationships from Database Systems (MLS, SCC, RLK), pp. 102–108.

POPL-1999-Kobayashi

Quasi-Linear Types (NK), pp. 29–42.

DLT-1997-Ilie #order #word

Remarks on Well Quasi Orders of Words (LI), pp. 399–409.

CAV-1997-CeceF #effectiveness #source code

Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract) (GC, AF), pp. 304–315.

ICPR-1996-MottlMBK #image #problem

Hidden tree-like quasi-Markov model and generalized technique for a class of image processing problems (VM, IBM, AB, AK), pp. 715–719.

SEKE-1995-WolffBS #information management

Quasi-Experiment as a Tool for Knowledge Engineering: An Example from Intelligent Tutoring (SW, CB, AS), pp. 260–267.

SIGIR-1995-Chien #natural language #performance

Fast and Quasi-Natural Language Search for Gigabits of Chinese Texts (LFC), pp. 112–120.

STOC-1994-Kosaraju #pattern matching #realtime

Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version) (SRK), pp. 310–316.

CIKM-1994-HelalKF

Quasi-Dynamic Two-Phase Locking (AH, THK, JF), pp. 211–218.

ILPS-1994-PodelskiR #algorithm #incremental #testing

The Beauty and the Beast Algorithm: Quasi-Linear Incremental Tests of Entailment and Disentailment over Trees (AP, PVR), pp. 359–374.

DAC-1993-YangLYD #performance #simulation

An Efficient Non-Quasi-Static Diode Model for Circuit Simulation (ATY, YL, JTY, RRD), pp. 720–725.

HCI-SHI-1993-RenM

The Minimal Sizes and the Quasi-Optimal Sizes for the Input Square During Pen-Input of Characters (XR, SM), pp. 1028–1033.

POPL-1993-LeeF #multi

Quasi-Static Scoping: Sharing Variable Bindings Across Multiple Lexical Scopes (SDL, DPF), pp. 479–492.

DAC-1992-SarabiP #canonical #network #performance

Fast Exact and Quasi-Minimal Minimization of Highly Testable Fixed-Polarity AND/XOR Canonical Networks (AS, MAP), pp. 30–35.

ICALP-1992-Nishida

Quasi-Deterministic 0L Systems (TYN), pp. 65–76.

POPL-1990-Thatte #static typing #type system

Quasi-Static Typing (SRT), pp. 367–381.

VLDB-1989-DuE #concurrent #correctness

Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase (WD, AKE), pp. 347–355.

STOC-1989-Vallee #integer #performance #polynomial

Provably Fast Integer Factoring with Quasi-Uniform Small Quadratic Residues (BV), pp. 98–106.

ALP-1988-Kucherov #algorithm #induction #proving #testing

A New Quasi-Reducibility Testing Algorithm and its Application to Proofs by Induction (GK), pp. 204–213.

STOC-1985-Vazirani #communication #complexity #generative #sequence #towards

Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-random Sources (Extended Abstract) (UVV), pp. 366–378.

DAC-1979-HsiehR #functional #latency #megamodelling

Macrosimulation with Quasi-general Symbolic FET Macromodel and Functional Latency (HYH, NBR), pp. 229–234.

STOC-1969-BookG #realtime

Quasi-Realtime Languages (Extended Abstract) (RVB, SAG), pp. 15–18.