BibSLEIGH — approximate tag

approximate

approximate

Tag #approximate

1297 papers:

POPL-2020-SaadFRM #probability: Optimal approximate sampling from discrete probability distributions (FAS, CEF, MCR, VKM), p. 31.
CGO-2020-JoshiFM #named #reliability #source code #verification: Aloe: verifying reliability of approximate programs in the presence of recovery mechanisms (KJ, VF, SM), pp. 56–67.
SCAM-2019-LeeBFGY #dependence #modelling #named: MOAD: Modeling Observation-Based Approximate Dependency (SL, DWB, RF, NG, SY), pp. 12–22.
ICFP-2019-EremondiTG #dependent type #normalisation: Approximate normalization for gradual dependent types (JE, ÉT, RG), p. 30.
CoG-2019-JoppenSF #game studies #using: Ordinal Bucketing for Game Trees using Dynamic Quantile Approximation (TJ, TS, JF), pp. 1–8.
CIKM-2019-BiswasGRB #clustering #privacy: Privacy Preserving Approximate K-means Clustering (CB, DG, DR, UB), pp. 1321–1330.
CIKM-2019-ChenZLYY #matrix #modelling: Synergizing Local and Global Models for Matrix Approximation (CC0, HZ, DL, JY, XY), pp. 2197–2200.
CIKM-2019-Lakhotia0 #algorithm #coordination #network #social: Approximation Algorithms for Coordinating Ad Campaigns on Social Networks (KL, DK0), pp. 339–348.
CIKM-2019-MauryaLM #graph #network #performance: Fast Approximations of Betweenness Centrality with Graph Neural Networks (SKM, XL0, TM), pp. 2149–2152.
CIKM-2019-Pasca #detection #lightweight #wiki: Approximate Definitional Constructs as Lightweight Evidence for Detecting Classes Among Wikipedia Articles (MP), pp. 2373–2376.
CIKM-2019-SalloumWH #big data #clustering #data analysis: A Sampling-Based System for Approximate Big Data Analysis on Computing Clusters (SS, YW, JZH), pp. 2481–2484.
ICML-2019-0001MZLK #adaptation #complexity #memory management #streaming: Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity (EK0, MM, MZ, SL, AK), pp. 3311–3320.
ICML-2019-AkrourP0N #algorithm #policy: Projections for Approximate Policy Iteration Algorithms (RA, JP, JP0, GN), pp. 181–190.
ICML-2019-AnconaOG #algorithm #network #polynomial: Explaining Deep Neural Networks with a Polynomial Time Algorithm for Shapley Value Approximation (MA, CÖ, MHG), pp. 272–281.
ICML-2019-AnilLG #sorting: Sorting Out Lipschitz Function Approximation (CA, JL, RBG), pp. 291–301.
ICML-2019-AtasuM #distance: Linear-Complexity Data-Parallel Earth Mover's Distance Approximations (KA, TM), pp. 364–373.
ICML-2019-BenzingGMMS #learning #realtime: Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning (FB, MMG, AM, AM, AS), pp. 604–613.
ICML-2019-CrawfordKT: Submodular Cost Submodular Cover with an Approximate Oracle (VGC, AK, MTT), pp. 1426–1435.
ICML-2019-DingDGHY #optimisation: Approximated Oracle Filter Pruning for Destructive CNN Width Optimization (XD, GD, YG, JH, CY), pp. 1607–1616.
ICML-2019-DoanMR #analysis #distributed #finite #learning #linear #multi: Finite-Time Analysis of Distributed TD(0) with Linear Function Approximation on Multi-Agent Reinforcement Learning (TTD, STM, JR), pp. 1626–1635.
ICML-2019-Elhamifar #algorithm: Sequential Facility Location: Approximate Submodularity and Greedy Algorithm (EE), pp. 1784–1793.
ICML-2019-FrerixB #effectiveness #matrix #orthogonal: Approximating Orthogonal Matrices with Effective Givens Factorization (TF, JB), pp. 1993–2001.
ICML-2019-FujiiS #adaptation #policy: Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio (KF, SS), pp. 2042–2051.
ICML-2019-IalongoWHR #modelling #process: Overcoming Mean-Field Approximations in Recurrent Gaussian Process Models (ADI, MvdW, JH, CER), pp. 2931–2940.
ICML-2019-KroshninTDDGU #complexity #on the: On the Complexity of Approximating Wasserstein Barycenters (AK, NT, DD, PED, AG, CAU), pp. 3530–3540.
ICML-2019-LinKS #performance: Fast and Simple Natural-Gradient Variational Inference with Mixture of Exponential-family Approximations (WL, MEK, MWS), pp. 3992–4002.
ICML-2019-LucibelloSL #estimation #overview: Generalized Approximate Survey Propagation for High-Dimensional Estimation (CL, LS, YML), pp. 4173–4182.
ICML-2019-OonoS #estimation #network #parametricity: Approximation and non-parametric estimation of ResNet-type convolutional neural networks (KO, TS), pp. 4922–4931.
ICML-2019-ParkYYS: Spectral Approximate Inference (SP, EY, SYY, JS), pp. 5052–5061.
ICML-2019-SinglaWFF #comprehension #higher-order #learning: Understanding Impacts of High-Order Loss Approximations and Features in Deep Learning Interpretation (SS0, EW, SF, SF), pp. 5848–5856.
ICML-2019-TrippeHAB #named #rank #using: LR-GLM: High-Dimensional Bayesian Inference Using Low-Rank Data Approximations (BLT, JHH, RA, TB), pp. 6315–6324.
ICML-2019-WeiszGS #algorithm #named: CapsAndRuns: An Improved Method for Approximately Optimal Algorithm Configuration (GW, AG, CS), pp. 6707–6715.
ICML-2019-WiqvistMPF #architecture #learning #network #statistics #summary: Partially Exchangeable Networks and Architectures for Learning Summary Statistics in Approximate Bayesian Computation (SW, PAM, UP, JF), pp. 6798–6807.
ICML-2019-XingNL: Calibrated Approximate Bayesian Inference (HX, GN, JL), pp. 6912–6920.
KDD-2019-WangD #empirical #performance: Fast Approximation of Empirical Entropy via Subsampling (CW, BD), pp. 658–667.
OOPSLA-2019-FernandoJM #canonical #parallel #safety #source code #verification: Verifying safety and accuracy of approximate parallel programs via canonical sequentialization (VF, KJ, SM), p. 29.
POPL-2019-DudenhefnerR #bound: Principality and approximation under dimensional bound (AD, JR), p. 29.
POPL-2019-SatoABGGH #convergence #higher-order #optimisation #probability #reasoning #source code #verification: Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization (TS, AA0, GB, MG, DG0, JH), p. 30.
ASE-2019-NejadgholiY #case study #learning #library #testing: A Study of Oracle Approximations in Testing Deep Learning Libraries (MN, JY0), pp. 785–796.
ICSE-2019-JoshiFM #algorithm #profiling #random #source code #statistics: Statistical algorithmic profiling for randomized approximate programs (KJ, VF, SM), pp. 608–618.
ASPLOS-2019-FernandoFAMT #manycore #named: Replica: A Wireless Manycore for Communication-Intensive and Approximate Data (VF, AF, SA, SM, JT), pp. 849–863.
CASE-2019-ZabinskyHH #bound #branch #heuristic: Integrating Heuristics and Approximations into a Branch and Bound Framework* (ZBZ, TYH, HH), pp. 774–779.
CC-2019-SchmittHB #adaptation #automation: Automatic adaptive approximation for stencil computations (MS, PH, CB), pp. 170–181.
CAV-2019-DimitrovaFT #implementation #specification: Synthesizing Approximate Implementations for Unrealizable Specifications (RD, BF, HT), pp. 241–258.
CAV-2019-NeupaneMM00 #analysis #infinity #model checking #named #probability: STAMINA: STochastic Approximate Model-Checker for INfinite-State Analysis (TN, CJM, CM, HZ0, ZZ0), pp. 540–549.
CAV-2019-DarulovaV #source code: Sound Approximation of Programs with Elementary Functions (ED, AV), pp. 174–183.
TAP-2019-0002JPW #hardware #question #verification: When Are Software Verification Results Valid for Approximate Hardware? (TI0, MCJ, FP, HW), pp. 3–20.
CIAA-2018-Sakharov #automaton #parsing: One-Counter Automata for Parsing and Language Approximation (AS), pp. 299–311.
DLT-2018-BellLS #regular expression: Additive Number Theory via Approximation by Regular Languages (JPB, TFL, JOS), pp. 121–132.
FM-2018-FanHM #partial order #reduction: Approximate Partial Order Reduction (CF, ZH, SM), pp. 588–607.
CIG-2018-DockhornA #game studies #learning #video: Forward Model Approximation for General Video Game Learning (AD, DA), pp. 1–8.
ICML-2018-0001MPS #first-order #on the: On the Limitations of First-Order Approximation in GAN Dynamics (JL0, AM, JP, LS), pp. 3011–3019.
ICML-2018-AhnCWS: Bucket Renormalization for Approximate Inference (SA, MC, AW, JS), pp. 109–118.
ICML-2018-BalkanskiS #adaptation: Approximation Guarantees for Adaptive Sampling (EB, YS), pp. 393–402.
ICML-2018-DaiS0XHLCS #convergence #learning #named: SBEED: Convergent Reinforcement Learning with Nonlinear Function Approximation (BD, AS, LL0, LX, NH, ZL0, JC, LS), pp. 1133–1142.
ICML-2018-FujimotoHM #fault: Addressing Function Approximation Error in Actor-Critic Methods (SF, HvH, DM), pp. 1582–1591.
ICML-2018-KimW #bound #predict #self #string: Self-Bounded Prediction Suffix Tree via Approximate String Matching (DK0, CJW), pp. 2664–2672.
ICML-2018-LaberMP: Binary Partitions with Approximate Minimum Impurity (ESL, MM, FdAMP), pp. 2860–2868.
ICML-2018-LoukasV #graph #scalability: Spectrally Approximating Large Graphs with Smaller Graphs (AL, PV), pp. 3243–3252.
ICML-2018-MartinLV #clustering #network #performance: Fast Approximate Spectral Clustering for Dynamic Networks (LM, AL, PV), pp. 3420–3429.
ICML-2018-MaXM #message passing #optimisation: Approximate message passing for amplitude based optimization (JM0, JX, AM), pp. 3371–3380.
ICML-2018-MehrabiTY #bound #network #power of: Bounds on the Approximation Power of Feedforward Neural Networks (MM, AT, MIY), pp. 3450–3458.
ICML-2018-Norouzi-FardTMZ #data type: Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams (ANF, JT, SM, AZ, AM, OS), pp. 3826–3835.
ICML-2018-Streeter #algorithm #modelling #predict: Approximation Algorithms for Cascading Prediction Models (MS), pp. 4759–4767.
ICML-2018-SunP #scalability: Scalable Approximate Bayesian Inference for Particle Tracking Data (RS, LP), pp. 4807–4816.
ICML-2018-TouatiBPV #convergence: Convergent TREE BACKUP and RETRACE with Function Approximation (AT, PLB, DP, PV), pp. 4962–4971.
ICML-2018-WangZLMM #parametricity #performance: Approximate Leave-One-Out for Fast Parameter Tuning in High Dimensions (SW, WZ, HL, AM, VSM), pp. 5215–5224.
ICML-2018-WeiszGS #algorithm #bound #named: LEAPSANDBOUNDS: A Method for Approximately Optimal Algorithm Configuration (GW, AG, CS), pp. 5254–5262.
ICML-2018-YonaR #learning: Probably Approximately Metric-Fair Learning (GY, GNR), pp. 5666–5674.
ICPR-2018-BoubrahimiMAHA #scalability: Scalable kNN Search Approximation for Time Series Data (SFB, RM, BA, SMH, RAA), pp. 970–975.
ICPR-2018-ChenLT #algorithm #detection #memory management: An Approximate Bayesian Long Short- Term Memory Algorithm for Outlier Detection (CC, XL, GT), pp. 201–206.
ICPR-2018-ChenWWK #classification #image #kernel #set: Riemannian kernel based Nyström method for approximate infinite-dimensional covariance descriptors with application to image set classification (KXC, XJW, RW, JK), pp. 651–656.
ICPR-2018-LabaoN #policy: Stabilizing Actor Policies by Approximating Advantage Distributions from K Critics (ABL, PCN), pp. 1253–1258.
ICPR-2018-RathoreBKRP #clustering #heatmap #scalability: Approximate Cluster Heat Maps of Large High-Dimensional Data (PR, JCB, DK, SR, MP), pp. 195–200.
ICPR-2018-ZhuX #graph #learning #scalability: Scalable Semi-Supervised Learning by Graph Construction with Approximate Anchors Embedding (HZ, MX), pp. 1331–1336.
KDD-2018-Cohen-SteinerKS #graph: Approximating the Spectrum of a Graph (DCS, WK, CS, GV), pp. 1263–1271.
KDD-2018-FuWHW #fault #learning #reduction #scalability: Scalable Active Learning by Approximated Error Reduction (WF, MW, SH, XW0), pp. 1396–1405.
POPL-2018-MazzaPV: Polyadic approximations, fibrations and intersection types (DM, LP, PV), p. 28.
ASPLOS-2018-GuoH #mobile #named: Potluck: Cross-Application Approximate Deduplication for Computation-Intensive Mobile Applications (PG, WH), pp. 271–284.
CASE-2018-AshouriHNS #detection #energy #performance #using: Energy Performance Based Anomaly Detection in Non-Residential Buildings Using Symbolic Aggregate Approximation (AA, YH, GRN, WS0), pp. 1400–1405.
CASE-2018-ToriiH #3d #estimation #parametricity #using: Model-less Estimation Method for Robot Grasping Parameters Using 3D Shape Primitive Approximation (TT, MH), pp. 580–585.
CAV-2018-CeskaMMSVV #automation #design #named: ADAC: Automated Design of Approximate Circuits (MC0, JM, VM, LS, ZV, TV), pp. 612–620.
CAV-2018-KongBH #set #using: Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes (HK, EB, TAH), pp. 449–467.
CAV-2018-GoubaultPS #difference #equation: Inner and Outer Approximating Flowpipes for Delay Differential Equations (EG, SP, LS), pp. 523–541.
CAV-2018-LiDPRV #named #performance #reachability: SimpleCAR: An Efficient Bug-Finding Tool Based on Approximate Reachability (JL, RD, GP, KYR, MYV), pp. 37–44.
CSL-2018-ChadhaS0 #automaton #probability #regular expression: Approximating Probabilistic Automata by Regular Languages (RC, APS, MV0), p. 23.
ICST-2018-HaririSLGKM: Approximate Transformations as Mutation Operators (FH, AS, OL, MG, SK, SM), pp. 285–296.
IJCAR-2018-GeMLZM #algorithm #probability: A New Probabilistic Algorithm for Approximate Model Counting (CG, FM, TL, JZ0, XM), pp. 312–328.
IJCAR-2018-ZeljicBWR #float #using: Exploring Approximations for Floating-Point Arithmetic Using UppSAT (AZ, PB, CMW, PR), pp. 246–262.
TAP-2018-BernardHK #approach #modelling #random #scalability: An Approximation-Based Approach for the Random Exploration of Large Models (JB0, PCH, OK), pp. 27–43.
TAP-2018-JulliandKMV #generative: Under-Approximation Generation Driven by Relevance Predicates and Variants (JJ, OK, PAM, GV), pp. 63–82.
VMCAI-2018-BiondiEHLMQ #data flow #scalability #source code: Scalable Approximation of Quantitative Information Flow in Programs (FB, MAE, AH, AL, KSM, JQ), pp. 71–93.
CSEET-2017-DemuthK #approach #scalability: An Approach for Project Task Approximation in a Large-Scale Software Project Course (BD, MK), pp. 67–76.
SEFM-2017-PolaSB #metric #on the: On Approximate Diagnosability of Metric Systems (GP, EDS, MDDB), pp. 269–283.
CIKM-2017-CaoZL #approach #distributed #effectiveness #graph #mining #named #scalability: PMS: an Effective Approximation Approach for Distributed Large-scale Graph Data Processing and Mining (YC, YZ, JL), pp. 1999–2002.
CIKM-2017-LiuCC #named #nearest neighbour: PQBF: I/O-Efficient Approximate Nearest Neighbor Search by Product Quantization (YL, HC, JC), pp. 667–676.
ICML-2017-Allen-ZhuL17a #component #matrix #performance: Faster Principal Component Regression and Stable Matrix Chebyshev Approximation (ZAZ, YL), pp. 107–115.
ICML-2017-AndersonG #algorithm #online #performance #rank: An Efficient, Sparsity-Preserving, Online Algorithm for Low-Rank Approximation (DGA, MG0), pp. 156–165.
ICML-2017-AvronKMMVZ #bound #fourier #kernel #random #statistics: Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees (HA, MK, CM, CM, AV, AZ), pp. 253–262.
ICML-2017-BalduzziMB #convergence #network: Neural Taylor Approximations: Convergence and Exploration in Rectifier Networks (DB, BM, TBY), pp. 351–360.
ICML-2017-ChierichettiG0L #algorithm #rank: Algorithms for lₚ Low-Rank Approximation (FC, SG, RK0, SL, RP, DPW), pp. 806–814.
ICML-2017-GraveJCGJ #performance: Efficient softmax approximation for GPUs (EG, AJ, MC, DG, HJ), pp. 1302–1310.
ICML-2017-KandasamyDSP #multi #optimisation: Multi-fidelity Bayesian Optimisation with Continuous Approximations (KK, GD, JGS, BP), pp. 1799–1808.
ICML-2017-KhannaEDGN #on the #optimisation #rank: On Approximation Guarantees for Greedy Low Rank Optimization (RK, ERE, AGD, JG, SNN), pp. 1837–1846.
ICML-2017-Lyu #kernel: Spherical Structured Feature Maps for Kernel Approximation (YL), pp. 2256–2264.
ICML-2017-MillerFA: Variational Boosting: Iteratively Refining Posterior Approximations (ACM, NJF, RPA), pp. 2420–2429.
ICML-2017-MirrokniLVW #bound: Tight Bounds for Approximate Carathéodory and Beyond (VSM, RPL, AV, SCwW), pp. 2440–2448.
ICML-2017-SafranS #network #trade-off: Depth-Width Tradeoffs in Approximating Natural Functions with Neural Networks (IS, OS), pp. 2979–2987.
ICML-2017-StichRJ #coordination: Approximate Steepest Coordinate Descent (SUS, AR, MJ), pp. 3251–3259.
ICML-2017-YeLZ #convergence: Approximate Newton Methods and Their Local Convergence (HY, LL, ZZ), pp. 3931–3939.
KDD-2017-0001YXWY #effectiveness #named #personalisation #rank: FORA: Simple and Effective Approximate Single-Source Personalized PageRank (SW0, RY, XX, ZW, YY), pp. 505–514.
KDD-2017-GabelKS #distributed: Anarchists, Unite: Practical Entropy Approximation for Distributed Streams (MG, DK, AS), pp. 837–846.
KDD-2017-MandrosBV #dependence #functional #reliability: Discovering Reliable Approximate Functional Dependencies (PM, MB, JV), pp. 355–363.
KDD-2017-Tagami #classification #multi #named #nearest neighbour: AnnexML: Approximate Nearest Neighbor Search for Extreme Multi-label Classification (YT), pp. 455–464.
PEPM-2017-FritzH #precise #python #type system: Cost versus precision for approximate typing for Python (LF, JH), pp. 89–98.
ASPLOS-2017-JevdjicSCM: Approximate Storage of Compressed and Encrypted Videos (DJ, KS, LC, HSM), pp. 361–373.
ASPLOS-2017-VoraGX #graph #named #performance #streaming: KickStarter: Fast and Accurate Computations on Streaming Graphs via Trimmed Approximations (KV, RG0, G(X), pp. 237–251.
CASE-2017-LeeMKR #on the: On the accuracy of analytic approximations for the mean cycle time in semiconductor manufacturing equipment with PM events (ML, JRM, AAK, KR), pp. 737–738.
CASE-2017-ZhaoR #polynomial: Polynomial trajectory approximation along specified paths for robot manipulators (RZ, SMR), pp. 106–111.
CGO-2017-MitraGMB #optimisation: Phase-aware optimization in approximate computing (SM, MKG, SM, SB), pp. 185–196.
CIAA-2016-Teichmann #context-free grammar #linear: Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages (MT), pp. 273–284.
FM-2016-YanJLWZ #bisimulation #csp #hybrid: Approximate Bisimulation and Discretization of Hybrid CSP (GY, LJ, YL, SW, NZ), pp. 702–720.
IFM-2016-DArgenioHLS #automaton #probability #statistics: Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata (PRD, AH, AL, SS), pp. 99–114.
SEFM-2016-Yavuz #abstraction #fixpoint: Combining Predicate Abstraction with Fixpoint Approximations (TY), pp. 104–120.
VS-Games-2016-KonecnySL #game studies #modelling: Procedural Modeling in Archaeology: Approximating Ionic Style Columns for Games (RK, SS, FL), pp. 1–8.
CIKM-2016-BleifussBFRW0PN #dataset #dependence #functional #scalability: Approximate Discovery of Functional Dependencies for Large Datasets (TB, SB, JF, JR, GW, SK0, TP, FN), pp. 1803–1812.
CIKM-2016-LiCL #graph #query #using: Approximating Graph Pattern Queries Using Views (JL, YC0, XL), pp. 449–458.
CIKM-2016-SuZBTM: Approximate Aggregates in Oracle 12C (HS, MZ, VB, JT, ACM), pp. 1603–1612.
ICML-2016-AbelHL #abstraction #behaviour: Near Optimal Behavior via Approximate State Abstraction (DA, DEH, MLL), pp. 2915–2923.
ICML-2016-BotteschBK: Speeding up k-means by approximating Euclidean distances via block vectors (TB, TB, MK), pp. 2578–2586.
ICML-2016-BuiHHLT #process #using: Deep Gaussian Processes for Regression using Approximate Expectation Propagation (TDB, DHL, JMHL, YL, RET), pp. 1472–1481.
ICML-2016-DEramoRN: Estimating Maximum Expected Value through Gaussian Approximation (CD, MR, AN), pp. 1032–1040.
ICML-2016-GalG #learning #nondeterminism #representation: Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learning (YG, ZG), pp. 1050–1059.
ICML-2016-GrosseM #matrix: A Kronecker-factored approximate Fisher matrix for convolution layers (RBG, JM), pp. 573–582.
ICML-2016-KandasamyY #parametricity: Additive Approximations in High Dimensional Nonparametric Regression via the SALSA (KK, YY), pp. 69–78.
ICML-2016-LiCLYSC #matrix #rank: Low-Rank Matrix Approximation with Stability (DL, CC0, QL, JY, LS, SMC), pp. 295–303.
ICML-2016-LiLR #rank: Recovery guarantee of weighted low-rank approximation via alternating minimization (YL, YL, AR), pp. 2358–2367.
ICML-2016-MitrovicST #kernel #named: DR-ABC: Approximate Bayesian Computation with Kernel-Based Distribution Regression (JM, DS, YWT), pp. 1482–1491.
ICML-2016-Pedregosa #optimisation: Hyperparameter optimization with approximate gradient (FP), pp. 737–746.
ICML-2016-PerolatPGSP #game studies #markov #policy: Softened Approximate Policy Iteration for Markov Games (JP, BP, MG, BS, OP), pp. 1860–1868.
ICML-2016-SiHD #performance #using: Computationally Efficient Nyström Approximation using Fast Transforms (SS, CJH, ISD), pp. 2655–2663.
ICPR-2016-GuY #on the #parametricity: On the magnitude of parameters of RBMs being universal approximators (LG, LY), pp. 2470–2474.
ICPR-2016-HajduHBLEHT #algorithm #grid #network #using: Measuring regularity of network patterns by grid approximations using the LLL algorithm (AH, BH, RB, IL, GE, LH, RT), pp. 1524–1529.
ICPR-2016-LuoTYZ #adaptation #matrix: Dual approximated nuclear norm based matrix regression via adaptive line search scheme (LL, QT, JY0, YZ), pp. 2538–2543.
ICPR-2016-MoazzenT #clustering #dataset: Sampling based approximate spectral clustering ensemble for partitioning datasets (YM, KT), pp. 1630–1635.
ICPR-2016-OsmanliogluOHS #analysis #performance #problem: Efficient approximation of labeling problems with applications to immune repertoire analysis (YO, SO, UH, AS), pp. 2410–2415.
ICPR-2016-OzanKG #nearest neighbour: Joint K-Means quantization for Approximate Nearest Neighbor Search (ECO, SK, MG), pp. 3645–3649.
ICPR-2016-PuZZDY #clustering #matrix #multi #robust: Multiview clustering based on Robust and Regularized Matrix Approximation (JP, QZ0, LZ, BD, JY), pp. 2550–2555.
KDD-2016-GuoLI #network: Convolutional Neural Networks for Steady Flow Approximation (XG, WL, FI), pp. 481–490.
KDD-2016-RiondatoU #graph #named: ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages (MR, EU), pp. 1145–1154.
KDD-2016-YuanYZH #difference #linear #optimisation #privacy #query: Convex Optimization for Linear Query Processing under Approximate Differential Privacy (GY, YY, ZZ, ZH), pp. 2005–2014.
KDD-2016-ZhangLG #graph #personalisation #rank: Approximate Personalized PageRank on Dynamic Graphs (HZ, PL, AG), pp. 1315–1324.
PLDI-2016-LaurenzanoHSMMT #latency #using: Input responsiveness: using canary inputs to dynamically steer approximation (MAL, PH, MS, SAM, JM, LT), pp. 161–176.
POPL-2016-DevriesePP #compilation: Fully-abstract compilation by approximate back-translation (DD, MP, FP), pp. 164–177.
SAS-2016-PredaGM: Completeness in Approximate Transduction (MDP, RG, IM), pp. 126–146.
ASPLOS-2016-GuoSCM #image #memory management #using: High-Density Image Storage Using Approximate Memory Cells (QG, KS, LC, HSM), pp. 413–426.
ASPLOS-2016-ParkAMTE #crowdsourcing #named #quality #towards: AxGames: Towards Crowdsourcing Quality Target Determination in Approximate Computing (JP, EA, DM, BT, HE), pp. 623–636.
ASPLOS-2016-SuiLFP #source code: Proactive Control of Approximate Programs (XS, AL, DSF, KP), pp. 607–621.
CASE-2016-SrinivasanC #approach #orthogonal #using: Path planning with user route preference - A reward surface approximation approach using orthogonal Legendre polynomials (ARS, SC), pp. 1100–1105.
CGO-2016-VassiliadisRDPA #analysis #automation #towards: Towards automatic significance analysis for approximate computing (VV, JR, JD, KP, CDA, NB, SL, UN), pp. 182–193.
CAV-2016-XueSE #set: Under-Approximating Backward Reachable Sets by Polytopes (BX0, ZS, AE), pp. 457–476.
VMCAI-2016-MarechalFKMP #multi #theorem #using: Polyhedral Approximation of Multivariate Polynomials Using Handelman's Theorem (AM, AF, TK0, DM, MP), pp. 166–184.
PODS-2015-AcharyaDHLS #algorithm #performance: Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms (JA, ID, CH, JZL, LS), pp. 249–263.
PODS-2015-BarceloPS #evaluation #performance: Efficient Evaluation and Approximation of Well-designed Pattern Trees (PB, RP, SS), pp. 131–144.
PODS-2015-IndykLR #testing: Erratum for: Approximating and Testing k-Histogram Distributions in Sub-linear Time (PI, RL, RR), p. 343.
SIGMOD-2015-CochezM #clustering #distance #linear: Twister Tries: Approximate Hierarchical Agglomerative Clustering for Average Distance in Linear Time (MC, HM), pp. 505–517.
SIGMOD-2015-GanT: DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation (JG, YT), pp. 519–530.
SIGMOD-2015-YangWWW #performance #query #string: Local Filtering: Improving the Performance of Approximate Queries on String Collections (XY, YW, BW, WW), pp. 377–392.
VLDB-2015-GatterbauerS #database #probability: Approximate Lifted Inference with Probabilistic Databases (WG, DS), pp. 629–640.
VLDB-2015-MitliagkasBDC #exclamation #graph #performance #rank: FrogWild! — Fast PageRank Approximations on Graph Engines (IM, MB, AGD, CC), pp. 874–885.
VLDB-2015-PottiP #named #paradigm #query: DAQ: A New Paradigm for Approximate Query Processing (NP, JMP), pp. 898–909.
SANER-2015-MedicherlaK #analysis #precise #scalability: Precision vs. scalability: Context sensitive analysis with prefix approximation (RKM, RK), pp. 281–290.
DLT-2015-NgRS #complexity #pattern matching: State Complexity of Neighbourhoods and Approximate Pattern Matching (TN, DR, KS), pp. 389–400.
ICALP-v1-2015-AmanatidisMNS #algorithm: Approximation Algorithms for Computing Maximin Share Allocations (GA, EM, AN, AS), pp. 39–51.
ICALP-v1-2015-AnshelevichKS #scalability: Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare (EA, KK, SS), pp. 52–64.
ICALP-v1-2015-BehsazFSS #algorithm #clustering: Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median (BB, ZF, MRS, RS), pp. 116–128.
ICALP-v1-2015-BhangaleKS #constraints #problem: Simultaneous Approximation of Constraint Satisfaction Problems (AB, SK, SS), pp. 193–205.
ICALP-v1-2015-BunT: Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (MB, JT), pp. 268–280.
ICALP-v1-2015-CoudronV #interactive #proving: Interactive Proofs with Approximately Commuting Provers (MC, TV), pp. 355–366.
ICALP-v1-2015-DoronT #graph #on the #probability #problem: On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace (DD, ATS), pp. 419–431.
ICALP-v1-2015-GalanisGJ: Approximately Counting H-Colourings is BIS-Hard (AG, LAG, MJ), pp. 529–541.
ICALP-v1-2015-GoldbergGL: Approximately Counting Locally-Optimal Structures (LAG, RG, JL), pp. 654–665.
ICALP-v1-2015-HuangL #combinator #optimisation #probability #problem: Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points (LH, JL), pp. 910–921.
ICALP-v1-2015-KhotS #using: Approximating CSPs Using LP Relaxation (SK, RS), pp. 822–833.
ICALP-v1-2015-KunnemannM #comprehension #heuristic #towards: Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic (MK, BM), pp. 859–871.
ICALP-v1-2015-MomkeW #algorithm #problem: A (2+ε)-Approximation Algorithm for the Storage Allocation Problem (TM, AW), pp. 973–984.
ICALP-v2-2015-Boreale #analysis #generative #probability: Analysis of Probabilistic Systems via Generating Functions and Padé Approximation (MB), pp. 82–94.
ICALP-v2-2015-Charron-BostFN #algorithm #network: Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms (BCB, MF, TN), pp. 528–539.
ICALP-v2-2015-Feldmann #graph #parametricity #problem: Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (AEF), pp. 588–600.
LATA-2015-BartonIP #string: Average-Case Optimal Approximate Circular String Matching (CB, CSI, SPP), pp. 85–96.
LATA-2015-BoichutCR #precise #towards: Towards More Precise Rewriting Approximations (YB, JC, PR), pp. 652–663.
CIG-2015-RunarssonL #evaluation #game studies #on the #using: On imitating Connect-4 game trajectories using an approximate n-tuple evaluation function (TPR, SML), pp. 208–213.
CHI-2015-FuccellaC #gesture #recognition: Unistroke Gesture Recognition Through Polyline Approximation and Alignment (VF, GC), pp. 3351–3354.
CIKM-2015-AinyBDDM #summary: Approximated Summarization of Data Provenance (EA, PB, SBD, DD, TM), pp. 483–492.
CIKM-2015-BuchA #learning #string #using: Approximate String Matching by End-Users using Active Learning (LB, AA0), pp. 93–102.
CIKM-2015-KangPC #clustering #rank #robust: Robust Subspace Clustering via Tighter Rank Approximation (ZK, CP, QC), pp. 393–401.
CIKM-2015-WangSFLXY #problem #reduction: Approximate Truth Discovery via Problem Scale Reduction (XW0, QZS, XSF, XL0, XX, LY), pp. 503–512.
ECIR-2015-ChappellGZ #nearest neighbour #slicing: Approximate Nearest-Neighbour Search with Inverted Signature Slice Lists (TC, SG, GZ), pp. 147–158.
ECIR-2015-Dutta #mining #named #statistics #string #using: MIST: Top-k Approximate Sub-string Mining Using Triplet Statistical Significance (SD), pp. 284–290.
ECIR-2015-TsaiKH #distance #multi #probability: Approximating Weighted Hamming Distance by Probabilistic Selection for Multiple Hash Tables (CYT, YHK, WHH), pp. 123–134.
ICML-2015-BlechschmidtGL #multi #optimisation #parametricity #problem: Tracking Approximate Solutions of Parameterized Optimization Problems over Multi-Dimensional (Hyper-)Parameter Domains (KB, JG, SL), pp. 438–447.
ICML-2015-FrostigGKS #algorithm #empirical #named #performance #probability: Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization (RF, RG, SK, AS), pp. 2540–2548.
ICML-2015-GalT #nondeterminism #process #representation: Improving the Gaussian Process Sparse Spectrum Approximation by Representing Uncertainty in Frequency Inputs (YG, RT), pp. 655–664.
ICML-2015-KordaA #bound #convergence #exponential #on the: On TD(0) with function approximation: Concentration bounds and a centered variant with exponential convergence (NK, PLA), pp. 626–634.
ICML-2015-LesnerS #policy: Non-Stationary Approximate Modified Policy Iteration (BL, BS), pp. 1567–1575.
ICML-2015-LondonHG #learning: The Benefits of Learning with Strongly Convex Approximate Inference (BL, BH, LG), pp. 410–418.
ICML-2015-ManoelKTZ #estimation #message passing: Swept Approximate Message Passing for Sparse Estimation (AM, FK, EWT, LZ), pp. 1123–1132.
ICML-2015-MartensG #network #optimisation: Optimizing Neural Networks with Kronecker-factored Approximate Curvature (JM, RBG), pp. 2408–2417.
ICML-2015-PerolatSPP #game studies #markov #programming: Approximate Dynamic Programming for Two-Player Zero-Sum Markov Games (JP, BS, BP, OP), pp. 1321–1329.
ICML-2015-SchaulHGS: Universal Value Function Approximators (TS, DH, KG, DS), pp. 1312–1320.
ICML-2015-UbaruMS #fault #matrix #rank #using: Low Rank Approximation using Error Correcting Coding Matrices (SU, AM, YS), pp. 702–710.
KDD-2015-FeldmanT #big data #constraints #matrix: More Constraints, Smaller Coresets: Constrained Matrix Approximation of Sparse Big Data (DF, TT), pp. 249–258.
KDD-2015-MarchXTYB #kernel #robust: Robust Treecode Approximation for Kernel Machines (WBM, BX, ST, CDY, GB), pp. 775–784.
KDD-2015-PengKLC #clustering #rank #using: Subspace Clustering Using Log-determinant Rank Approximation (CP, ZK, HL, QC), pp. 925–934.
MLDM-2015-FerrerSR #distance #edit distance #graph #heuristic #learning: Learning Heuristics to Reduce the Overestimation of Bipartite Graph Edit Distance Approximation (MF, FS, KR), pp. 17–31.
SIGIR-2015-ChenLZLS #matrix #named #recommendation #scalability: WEMAREC: Accurate and Scalable Recommendation through Weighted and Ensemble Matrix Approximation (CC, DL, YZ, QL, LS), pp. 303–312.
OOPSLA-2015-AchourR #detection: Approximate computation with outlier detection in Topaz (SA, MCR), pp. 711–730.
OOPSLA-2015-BostonSGC #flexibility #probability #programming #type inference: Probability type inference for flexible approximate programming (BB, AS, DG, LC), pp. 470–487.
POPL-2015-BartheGAHRS #design #difference #higher-order #privacy #refinement #relational: Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy (GB, MG, EJGA, JH, AR, PYS), pp. 55–68.
ESEC-FSE-2015-ParkEZNH #composition #named #programming: FlexJava: language support for safe and modular approximate programming (JP, HE, XZ, MN, WH), pp. 745–757.
ESEC-FSE-2015-Theisen #automation: Automated attack surface approximation (CT), pp. 1063–1065.
ICSE-v2-2015-TheisenHMMW #stack: Approximating Attack Surfaces with Stack Traces (CT, KH, PM, BM, LAW), pp. 199–208.
SAC-2015-BrideJM #generative #testing: Tri-modal under-approximation of event systems for test generation (HB, JJ, PAM), pp. 1737–1744.
SAC-2015-CharuvakaR #classification #coordination #scalability: Approximate block coordinate descent for large scale hierarchical classification (AC, HR), pp. 837–844.
SAC-2015-HsiehNKC #performance #query #recommendation: Efficient approximate thompson sampling for search query recommendation (CCH, JN, TK, JC), pp. 740–746.
ASPLOS-2015-GoiriBNN #framework #named #pipes and filters: ApproxHadoop: Bringing Approximations to MapReduce Frameworks (IG, RB, SN, TDN), pp. 383–397.
ASPLOS-2015-RingenburgSACG #debugging #monitoring #quality #source code: Monitoring and Debugging the Quality of Results in Approximate Programs (MFR, AS, IA, LC, DG), pp. 399–411.
CASE-2015-NetoCHS #optimisation: A piecewise linear-quadratic approximation for production optimization of gas-lifted oil fields (LRN, EC, RH, TLS), pp. 793–798.
CC-2015-DarteI #optimisation #parametricity: Exact and Approximated Data-Reuse Optimizations for Tiling with Parametric Sizes (AD, AI), pp. 151–170.
CGO-2015-NagarajG #analysis #mining #pointer #using: Approximating flow-sensitive pointer analysis using frequent itemset mining (VN, RG), pp. 225–234.
DAC-2015-LiLSH #optimisation #precise #synthesis: Joint precision optimization and high level synthesis for approximate computing (CL, WL, SSS, JH), p. 6.
DAC-2015-RanjanVFRR #energy #performance: Approximate storage for energy efficient spintronic memories (AR, SV, XF, KR, AR), p. 6.
DAC-2015-VenkataramaniCR #performance: Approximate computing and the quest for computing efficiency (SV, STC, KR, AR), p. 6.
DATE-2015-ChenLH #reliability: An approximate voting scheme for reliable computing (KC, FL, JH), pp. 293–296.
DATE-2015-DarkeCVSM #bound #model checking #using: Over-approximating loops to prove properties using bounded model checking (PD, BC, RV, US, RM), pp. 1407–1412.
DATE-2015-HuQ #fault: A new approximate adder with low relative error and correct sign calculation (JH, WQ), pp. 1449–1454.
DATE-2015-RahaVRR #configuration management #energy #performance #quality: Quality configurable reduce-and-rank for energy efficient approximate computing (AR, SV, VR, AR), pp. 665–670.
DATE-2015-RahimiGCBG #energy #memory management: Approximate associative memristive memory for energy-efficient GPUs (AR, AG, KTC, LB, RKG), pp. 1497–1502.
DATE-2015-RustLP #architecture: QR-decomposition architecture based on two-variable numeric function approximation (JR, FL, SP), pp. 892–895.
DATE-2015-RustP #design #multi: Design method for multiplier-less two-variable numeric function approximation (JR, SP), pp. 948–953.
DATE-2015-VenkataramaniCR: Computing approximately, and efficiently (SV, STC, KR, AR), pp. 748–751.
DATE-2015-YazdanbakhshMTP #design #hardware #named: Axilog: language support for approximate hardware design (AY, DM, BT, JP, AN, SS, KR, NR, RJ, AR, HE, KB), pp. 812–817.
DATE-2015-ZhangWTYX #framework #named #network: ApproxANN: an approximate computing framework for artificial neural network (QZ, TW, YT, FY, QX), pp. 701–706.
HPCA-2015-GrigorianFR #named #reliability: BRAINIAC: Bringing reliable accuracy into neurally-implemented approximate computing (BG, NF, GR), pp. 615–626.
HPCA-2015-MoreauWNSECO #named #programmable: SNNAP: Approximate computing on programmable SoCs via neural acceleration (TM, MW, JN, AS, HE, LC, MO), pp. 603–614.
PDP-2015-Inostrosa-Psijas #distributed #parallel #simulation: Load Balance Strategies for DEVS Approximated Parallel and Distributed Discrete-Event Simulations (AIP, VGC, RS, MM), pp. 337–340.
SOSP-2015-Hoffmann #energy #named: JouleGuard: energy guarantees for approximate applications (HH), pp. 198–214.
STOC-2015-AndoniR: Optimal Data-Dependent Hashing for Approximate Near Neighbors (AA, IR), pp. 793–801.
STOC-2015-Barman #nash #theorem: Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory’s Theorem (SB), pp. 361–369.
STOC-2015-Chechik #bound #distance: Approximate Distance Oracles with Improved Bounds (SC), pp. 1–10.
STOC-2015-CohenEMMP #clustering #rank #reduction: Dimensionality Reduction for k-Means Clustering and Low Rank Approximation (MBC, SE, CM, CM, MP), pp. 163–172.
STOC-2015-ColeG #nash #social: Approximating the Nash Social Welfare with Indivisible Items (RC, VG), pp. 371–380.
STOC-2015-FoxKM #polynomial: A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection (KF, PNK, SM), pp. 841–850.
STOC-2015-KawarabayashiS #graph: Beyond the Euler Characteristic: Approximating the Genus of General Graphs (KiK, AS), pp. 675–682.
STOC-2015-Louis #algorithm #markov: Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms (AL), pp. 713–722.
STOC-2015-MulzerNSS #nearest neighbour: Approximate k-flat Nearest Neighbor Search (WM, HLN, PS, YS), pp. 783–792.
TACAS-2015-ChistikovDM #estimation #probability #smt #source code: Approximate Counting in SMT and Value Estimation for Probabilistic Programs (DVC, RD, RM), pp. 320–334.
CAV-2015-DesaiSQBE #abstraction #distributed: Approximate Synchrony: An Abstraction for Distributed Almost-Synchronous Systems (AD, SAS, SQ, DB, JCE), pp. 429–448.
ICLP-J-2015-BogaertsB #compilation #fixpoint #logic programming #source code #using: Knowledge compilation of logic programs using approximation fixpoint theory (BB, GVdB), pp. 464–480.
LICS-2015-BallePP #automaton #canonical: A Canonical Form for Weighted Automata and Applications to Approximate Minimization (BB, PP, DP), pp. 701–712.
SIGMOD-2014-AgarwalMKTJMMS #performance #query #reliability: Knowing when you’re wrong: building fast and reliable approximate query processing systems (SA, HM, AK, AT, MIJ, SM, BM, IS), pp. 481–492.
SIGMOD-2014-TrummerK #optimisation #query: Approximation schemes for many-objective query optimization (IT, CK), pp. 1299–1310.
SIGMOD-2014-YamamotoIF #data type #mining: Resource-oriented approximation for frequent itemset mining from bursty data streams (YY, KI, SF), pp. 205–216.
SIGMOD-2014-ZengGGMZ #named #query #scalability: ABS: a system for scalable approximate queries with accuracy guarantees (KZ, SG, JG, BM, CZ), pp. 1067–1070.
SIGMOD-2014-ZengGMZ #estimation #fault #performance #query: The analytical bootstrap: a new method for fast error estimation in approximate query processing (KZ, SG, BM, CZ), pp. 277–288.
VLDB-2014-AthanassoulisA #named: BF-Tree: Approximate Tree Indexing (MA, AA), pp. 1881–1892.
VLDB-2014-GhashamiPL #distributed #matrix: Continuous Matrix Approximation on Distributed Data (MG, JMP, FL), pp. 809–820.
VLDB-2014-He #challenge #data transformation #hardware: When Data Management Systems Meet Approximate Hardware: Challenges and Opportunities (BH), pp. 877–880.
VLDB-2014-LiuCHLS #named #nearest neighbour #performance: SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search (YL, JC, ZH, HL, HTS), pp. 745–756.
VLDB-2014-ShangY #graph: Auto-Approximation of Graph Computing (ZS, JXY), pp. 1833–1844.
VLDB-2015-SunWQZL14 #named #nearest neighbour #query: SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index (YS, WW, JQ, YZ, XL), pp. 1–12.
ICALP-v1-2014-BlaisHST #on the: On DNF Approximators for Monotone Boolean Functions (EB, JH, RAS, LYT), pp. 235–246.
ICALP-v1-2014-BrietDHS #bound: Lower Bounds for Approximate LDCs (JB, ZD, GH, SS), pp. 259–270.
ICALP-v1-2014-KhotTW #complexity: The Complexity of Somewhat Approximation Resistant Predicates (SK, MT, PW), pp. 689–700.
ICALP-v1-2014-KolMSY #bound #rank: Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound (GK, SM, AS, AY), pp. 701–712.
ICALP-v1-2014-Lampis #graph #using: Parameterized Approximation Schemes Using Graph Widths (ML), pp. 775–786.
ICALP-v1-2014-Wulff-Nilsen #distance #graph #performance: Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles (CWN), pp. 1063–1074.
ICALP-v2-2014-Ghaffari #distributed #set: Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set (MG), pp. 483–494.
ICALP-v2-2014-NikzadR #algorithm #multi #problem: Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems (AN, RR), pp. 568–607.
ICEIS-v1-2014-PengM #string: Approximate String Matching Techniques (TP, CM), pp. 217–224.
CIKM-2014-MengCS #analysis #keyword #query #semantics: Semantic Approximate Keyword Query Based on Keyword and Query Coupling Relationship Analysis (XM, LC, JS), pp. 529–538.
CIKM-2014-UysalBSS #database #distance #multi #performance #scalability #using: Efficient Filter Approximation Using the Earth Mover’s Distance in Very Large Multimedia Databases with Feature Signatures (MSU, CB, JS, TS), pp. 979–988.
ICML-c1-2014-LiuJL #kernel #performance #using: Efficient Approximation of Cross-Validation for Kernel Methods using Bouligand Influence Function (YL, SJ, SL), pp. 324–332.
ICML-c1-2014-MannM #policy #scalability: Scaling Up Approximate Value Iteration with Options: Better Policies with Fewer Iterations (TAM, SM), pp. 127–135.
ICML-c1-2014-SiHD #kernel #memory management #performance: Memory Efficient Kernel Approximation (SS, CJH, ISD), pp. 701–709.
ICML-c2-2014-BachmanFP: Sample-based approximate regularization (PB, AMF, DP), pp. 1926–1934.
ICML-c2-2014-GleichM #algorithm #case study: Anti-differentiating approximation algorithms: A case study with min-cuts, spectral, and flow (DG, MWM), pp. 1018–1025.
ICML-c2-2014-LiuSD #modelling #visual notation: Gaussian Approximation of Collective Graphical Models (LPL, DS, TGD), pp. 1602–1610.
ICML-c2-2014-NiuDPS #learning #multi: Transductive Learning with Multi-class Volume Approximation (GN, BD, MCdP, MS), pp. 1377–1385.
ICML-c2-2014-RezendeMW #generative #modelling #probability: Stochastic Backpropagation and Approximate Inference in Deep Generative Models (DJR, SM, DW), pp. 1278–1286.
ICML-c2-2014-SatoN #analysis #equation #probability #process #using: Approximation Analysis of Stochastic Gradient Langevin Dynamics by using Fokker-Planck Equation and Ito Process (IS, HN), pp. 982–990.
ICML-c2-2014-Scherrer #comparison #policy: Approximate Policy Iteration Schemes: A Comparison (BS), pp. 1314–1322.
ICML-c2-2014-ShamirS0 #distributed #optimisation #using: Communication-Efficient Distributed Optimization using an Approximate Newton-type Method (OS, NS, TZ), pp. 1000–1008.
ICML-c2-2014-TamarMX #robust #scalability #using: Scaling Up Robust MDPs using Function Approximation (AT, SM, HX), pp. 181–189.
ICML-c2-2014-TaylorGP #analysis #linear #programming: An Analysis of State-Relevance Weights and Sampling Distributions on L1-Regularized Approximate Linear Programming Approximation Accuracy (GT, CG, DP), pp. 451–459.
ICML-c2-2014-ZhangDW #nearest neighbour: Composite Quantization for Approximate Nearest Neighbor Search (TZ, CD, JW), pp. 838–846.
ICPR-2014-AkhtarSM #algorithm #named: SUnGP: A Greedy Sparse Approximation Algorithm for Hyperspectral Unmixing (NA, FS, ASM), pp. 3726–3731.
ICPR-2014-LuZXGW #morphism #quantum: Approximate Maximum Common Sub-graph Isomorphism Based on Discrete-Time Quantum Walk (KL, YZ, KX, YG, RCW), pp. 1413–1418.
ICPR-2014-MatveevG #detection #segmentation: Iris Segmentation System Based on Approximate Feature Detection with Subsequent Refinements (IM, KG), pp. 1704–1709.
ICPR-2014-QuachDB #rank #recognition #representation #robust: Sparse Representation and Low-Rank Approximation for Robust Face Recognition (KGQ, CND, TDB), pp. 1330–1335.
ICPR-2014-RiesenBF #distance #edit distance #graph #metric: Improving Graph Edit Distance Approximation by Centrality Measures (KR, HB, AF), pp. 3910–3914.
ICPR-2014-TaoIWS #data transformation #rank #representation: Ensemble Manifold Structured Low Rank Approximation for Data Representation (LT, HHSI, YW, XS), pp. 744–749.
ICPR-2014-TasdemirMY #clustering: Geodesic Based Similarities for Approximate Spectral Clustering (KT, YM, IY), pp. 1360–1364.
KDD-2014-Ting: Streamed approximate counting of distinct elements: beating optimal batch methods (DT), pp. 442–451.
KR-2014-StrassW #complexity #fixpoint #framework: Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory (HS, JPW).
SEKE-2014-Otunba0 #detection #named: APT: Approximate Period Detection in Time Series (RO, JL), pp. 490–494.
AMT-2014-TroyaWBV #model transformation #towards: Towards Approximate Model Transformations (JT, MW, LB, AV), pp. 44–53.
SPLC-2014-OlaecheaRGC #comparison #multi #optimisation #product line: Comparison of exact and approximate multi-objective optimization for software product lines (RO, DR, JG, KC), pp. 92–101.
OOPSLA-2014-MisailovicCAQR #kernel #named #optimisation: Chisel: reliability- and accuracy-aware optimization of approximate computational kernels (SM, MC, SA, ZQ, MCR), pp. 309–328.
LOPSTR-2014-ChowdhuryLCKY #case study #logic programming #polynomial #semantics #source code: Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies (MSC, FL, WC, AK, JHY), pp. 279–296.
SAS-2014-BakhirkinBP #abstraction #analysis: Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction (AB, JB, NP), pp. 34–50.
ASE-2014-LuckowPDFV #execution #nondeterminism #probability #source code #symbolic computation: Exact and approximate probabilistic symbolic execution for nondeterministic programs (KSL, CSP, MBD, AF, WV), pp. 575–586.
SAC-2014-FanC #framework #network #scalability #social: An approximate framework for scaling social influence computation in large networks (YCF, HC), pp. 610–615.
ASPLOS-2014-SamadiJLM #named #parallel: Paraprox: pattern-based approximation for data parallel applications (MS, DAJ, JL, SAM), pp. 35–50.
CASE-2014-LiuXL #capacity: A queuing approximation method for capacity planning of emergency department with time-varying demand (QL, XX, RL), pp. 558–563.
CASE-2014-ShiWS #matrix: Approximation method to rank-one binary matrix factorization (ZS, LW, LS), pp. 800–805.
DAC-2014-MukherjeeAL: Approximate property checking of mixed-signal circuits (PM, CSA, PL), p. 6.
DAC-2014-SchaffnerGSKB #complexity #linear #realtime #video: An Approximate Computing Technique for Reducing the Complexity of a Direct-Solver for Sparse Linear Systems in Real-Time Video Processing (MS, FKG, AS, HK, LB), p. 6.
DAC-2014-ZhangYYX #framework #named: ApproxIt: An Approximate Computing Framework for Iterative Methods (QZ, FY, RY, QX), p. 6.
DATE-2014-CabodiPQV #reachability #satisfiability: Tightening BDD-based approximate reachability with SAT-based clause generalization∗ (GC, PP, SQ, DV), pp. 1–6.
DATE-2014-ChangOSK #estimation #statistics: Approximating the age of RF/analog circuits through re-characterization and statistical estimation (DC, SO, OS, RK), pp. 1–4.
DATE-2014-KamalGAP #performance #using: Improving efficiency of extensible processors by using approximate custom instructions (MK, AG, AAK, MP), pp. 1–4.
DATE-2014-LiuHL #configuration management #fault #multi #power management: A low-power, high-performance approximate multiplier with configurable partial error recovery (CL, JH, FL), pp. 1–4.
DATE-2014-NepalLBR #automation #behaviour #named #synthesis: ABACUS: A technique for automated behavioral synthesis of approximate computing circuits (KN, YL, RIB, SR), pp. 1–6.
DATE-2014-NovoFIAC #case study #energy #performance #runtime: Energy efficient MIMO processing: A case study of opportunistic run-time approximations (DN, NF, PI, UA, FC), pp. 1–6.
DATE-2014-RanjanRVRR #named #synthesis: ASLAN: Synthesis of approximate sequential circuits (AR, AR, SV, KR, AR), pp. 1–6.
LCTES-2014-RoyRWW #analysis #automation #named: ASAC: automatic sensitivity analysis for approximate computing (PR, RR, CW, WFW), pp. 95–104.
STOC-2014-AgarwalS #algorithm #geometry #metric: Approximation algorithms for bipartite matching with metric and geometric costs (PKA, RS), pp. 555–564.
STOC-2014-Babichenko #complexity #nash #query: Query complexity of approximate nash equilibria (YB), pp. 535–544.
STOC-2014-BunUV #difference #privacy: Fingerprinting codes and the price of approximate differential privacy (MB, JU, SPV), pp. 1–10.
STOC-2014-ChanDSS #estimation #performance #polynomial: Efficient density estimation via piecewise polynomial approximation (SoC, ID, RAS, XS), pp. 604–613.
STOC-2014-Chechik #constant #distance #query: Approximate distance oracles with constant query time (SC), pp. 654–663.
STOC-2014-DeS #performance #polynomial: Efficient deterministic approximate counting for low-degree polynomial threshold functions (AD, RAS), pp. 832–841.
STOC-2014-EneV #algorithm #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-FriggstadS #algorithm #bound: Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing (ZF, CS), pp. 744–753.
STOC-2014-KhotTW: A characterization of strong approximation resistance (SK, MT, PW), pp. 634–643.
STOC-2014-KrishnaswamyNPS #clustering #design #energy #network #performance: Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing (RK, VN, KP, CS), pp. 734–743.
STOC-2014-MakarychevMV #constant: Constant factor approximation for balanced cut in the PIE model (KM, YM, AV), pp. 41–49.
STOC-2014-Nanongkai #algorithm #distributed: Distributed approximation algorithms for weighted shortest paths (DN), pp. 565–573.
TACAS-2014-SoudjaniA #markov #precise #probability #process: Precise Approximations of the Probability Distribution of a Markov Process in Time: An Application to Probabilistic Invariance (SEZS, AA), pp. 547–561.
CAV-2014-LeeS #abstraction #bound #reachability #scalability #verification: Unbounded Scalable Verification Based on Approximate Property-Directed Reachability and Datapath Abstraction (SL, KAS), pp. 849–865.
IJCAR-2014-EhlersL #finite #incremental #logic #satisfiability: A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic (RE, ML), pp. 360–366.
IJCAR-2014-ZeljicWR: Approximations for Model Construction (AZ, CMW, PR), pp. 344–359.
SAT-2014-Bulatov0 #random #satisfiability: Approximating Highly Satisfiable Random 2-SAT (AAB, CW), pp. 384–398.
ICDAR-2013-0001LBP #documentation #graph #string #visual notation: Near Convex Region Adjacency Graph and Approximate Neighborhood String Matching for Symbol Spotting in Graphical Documents (AD, JL, HB, UP), pp. 1078–1082.
ICDAR-2013-RazafindramananaRV #recognition: Alpha*-Approximated Delaunay Triangulation Based Descriptors for Handwritten Character Recognition (OR, FR, GV), pp. 440–444.
SIGMOD-2013-KimS #algorithm #performance #string: Efficient top-k algorithms for approximate substring matching (YK, KS), pp. 385–396.
VLDB-2013-DuttaNB #approach #data type #detection #streaming: Streaming Quotient Filter: A Near Optimal Approximate Duplicate Detection Approach for Data Streams (SD, AN, SKB), pp. 589–600.
VLDB-2013-KimelfeldVW #complexity #multi: Multi-Tuple Deletion Propagation: Approximations and Complexity (BK, JV, DPW), pp. 1558–1569.
VLDB-2013-SavkovicPTN #query: Complete Approximations of Incomplete Queries (OS, PM, AT, WN), pp. 1378–1381.
VLDB-2013-SimoesGG #algorithm #information management #performance #using: When Speed Has a Price: Fast Information Extraction Using Approximate Algorithms (GS, HG, LG), pp. 1462–1473.
VLDB-2013-TaoHCC #database: Approximate MaxRS in Spatial Databases (YT, XH, DWC, CWC), pp. 1546–1557.
VLDB-2013-ZhuFCY #incremental #personalisation #rank: Incremental and Accuracy-Aware Personalized PageRank through Scheduled Approximation (FZ, YF, KCCC, JY), pp. 481–492.
VLDB-2014-WangDTZ13 #effectiveness #n-gram #performance #sequence: Efficient and Effective KNN Sequence Search with Approximate n-grams (XW, XD, AKHT, ZZ), pp. 1–12.
CIAA-2013-DreyfusHK #analysis #reachability: Enhancing Approximations for Regular Reachability Analysis (AD, PCH, OK), pp. 331–339.
CIAA-2013-HanKS #automaton #context-free grammar #finite: Approximate Matching between a Context-Free Grammar and a Finite-State Automaton (YSH, SKK, KS), pp. 146–157.
ICALP-v1-2013-BateniHL #algorithm #problem: Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems (MB, MH, VL), pp. 81–92.
ICALP-v1-2013-BienkowskiBCDNSSY #algorithm #problem: Approximation Algorithms for the Joint Replenishment Problem with Deadlines (MB, JB, MC, NBD, TN, MS, GS, NEY), pp. 135–147.
ICALP-v1-2013-BunT #bound: Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities (MB, JT), pp. 303–314.
ICALP-v1-2013-KonradR #communication #streaming: Approximating Semi-matchings in Streaming and in Two-Party Communication (CK, AR), pp. 637–649.
ICALP-v1-2013-WeimannY #graph #linear: Approximating the Diameter of Planar Graphs in Near Linear Time (OW, RY), pp. 828–839.
RTA-2013-BoichutCR: Over-approximating Descendants by Synchronized Tree Languages (YB, JC, PR), pp. 128–142.
SEFM-2013-SargolzaeiSAA #behaviour #web #web service: A Tool for Behaviour-Based Discovery of Approximately Matching Web Services (MS, FS, FA, HA), pp. 152–166.
SFM-2013-BortolussiH #behaviour #markov #modelling: Checking Individual Agent Behaviours in Markov Population Models by Fluid Approximation (LB, JH), pp. 113–149.
CIG-2013-NorrisW #equilibrium #nash #statistics: A statistical exploitation module for Texas Hold'em: And it's benefits when used with an approximate nash equilibrium strategy (KN, IDW), pp. 1–8.
ICEIS-J-2013-RudraGA13a #query: Estimating Sufficient Sample Sizes for Approximate Decision Support Queries (AR, RPG, NRA), pp. 85–99.
ICEIS-v1-2013-RudraGA #query: Selecting Adequate Samples for Approximate Decision Support Queries (AR, RPG, NRA), pp. 46–55.
CIKM-2013-Caruana #clustering #named #question: Clustering: probably approximately useless? (RC), pp. 1259–1260.
ICML-c1-2013-GilboaSCG #multi #process #scalability #using: Scaling Multidimensional Gaussian Processes using Projected Additive Approximations (EG, YS, JPC, EG), pp. 454–461.
ICML-c1-2013-KrauseFGI: Approximation properties of DBNs with binary hidden units and real-valued visible units (OK, AF, TG, CI), pp. 419–426.
ICML-c2-2013-KimVS #corpus #modelling #topic: A Variational Approximation for Topic Modeling of Hierarchical Corpora (DkK, GMV, LKS), pp. 55–63.
ICML-c2-2013-LeeKLS #matrix #rank: Local Low-Rank Matrix Approximation (JL, SK, GL, YS), pp. 82–90.
ICML-c3-2013-KimS #modelling #topic: Manifold Preserving Hierarchical Topic Models for Quantization and Approximation (MK, PS), pp. 1373–1381.
ICML-c3-2013-PapailiopoulosDK #rank: Sparse PCA through Low-rank Approximations (DSP, AGD, SK), pp. 747–755.
ICML-c3-2013-SheldonSKD #modelling #visual notation: Approximate Inference in Collective Graphical Models (DS, TS, AK, TGD), pp. 1004–1012.
KDD-2013-AnchuriZBGS #graph #mining: Approximate graph mining with label costs (PA, MJZ, OB, SG, MS), pp. 518–526.
OOPSLA-2013-ChoiNS #android #learning #testing #user interface: Guided GUI testing of android apps with minimal restart and approximate learning (WC, GCN, KS), pp. 623–640.
PEPM-2013-CarbinKMR #program transformation: Verified integrity properties for safe approximate program transformations (MC, DK, SM, MCR), pp. 63–66.
ICSE-2013-FeldthausSSDT #graph #ide #javascript #performance: Efficient construction of approximate call graphs for JavaScript IDE services (AF, MS, MS, JD, FT), pp. 752–761.
CASE-2013-JeongMS #assessment #design #lifecycle #reasoning #using: Approximate life cycle assessment using case-based reasoning for the eco design of products (MGJ, JRM, HWS), pp. 486–491.
DAC-2013-ChippaCRR #analysis: Analysis and characterization of inherent application resilience for approximate computing (VKC, STC, KR, AR), p. 9.
DAC-2013-KarthikR #linear #modelling #named #using: ABCD-L: approximating continuous linear systems using boolean models (KVA, JSR), p. 9.
DATE-2013-VenkataramaniRR #configuration management #design #named #paradigm #quality: Substitute-and-simplify: a unified design paradigm for approximate and quality configurable circuits (SV, KR, AR), pp. 1367–1372.
STOC-2013-AlonLSV #algorithm #matrix #rank: The approximate rank of a matrix and its algorithmic applications: approximate rank (NA, TL, AS, SV), pp. 675–684.
STOC-2013-BitanskyP #encryption #obfuscation #on the: On the impossibility of approximate obfuscation and applications to resettable cryptography (NB, OP), pp. 241–250.
STOC-2013-BrandaoH13a #quantum: Product-state approximations to quantum ground states (FGSLB, AWH), pp. 871–880.
STOC-2013-Chan #independence: Approximation resistance from pairwise independent subgroups (SOC), pp. 447–456.
STOC-2013-ClarksonW #rank: Low rank approximation and regression in input sparsity time (KLC, DPW), pp. 81–90.
STOC-2013-Huang #satisfiability: Approximation resistance on satisfiable instances for predicates with few accepting inputs (SH), pp. 457–466.
STOC-2013-LiS #pseudo: Approximating k-median via pseudo-approximation (SL, OS), pp. 901–910.
STOC-2013-LiY #combinator #optimisation #probability: Stochastic combinatorial optimization via poisson approximation (JL, WY), pp. 971–980.
STOC-2013-MendesH #multi: Multidimensional approximate agreement in Byzantine asynchronous systems (HM, MH), pp. 391–400.
STOC-2013-NikolovTZ #difference #geometry #privacy: The geometry of differential privacy: the sparse and approximate cases (AN, KT, LZ), pp. 351–360.
STOC-2013-RodittyW #algorithm #graph #performance: Fast approximation algorithms for the diameter and radius of sparse graphs (LR, VVW), pp. 515–524.
TACAS-2013-GantyIK #integer #source code #summary: Underapproximation of Procedure Summaries for Integer Programs (PG, RI, FK), pp. 245–259.
CAV-2013-KroeningLW #c #detection #performance #source code: Under-Approximating Loops in C Programs for Fast Counterexample Detection (DK, ML, GW), pp. 381–396.
CAV-2013-PauleveAK #automaton #network #reachability #scalability #set: Under-Approximating Cut Sets for Reachability in Large Scale Automata Networks (LP, GA, HK), pp. 69–84.
CSL-2013-BulatovDT #complexity: Descriptive complexity of approximate counting CSPs (AAB, VD, MT), pp. 149–164.
ICLP-J-2013-AlvianoP #fuzzy #set: Fuzzy answer sets approximations (MA, RP), pp. 753–767.
PODS-2012-BarceloLR #performance #query: Efficient approximations of conjunctive queries (PB, LL, MR), pp. 249–260.
PODS-2012-IndykLR #testing: Approximating and testing k-histogram distributions in sub-linear time (PI, RL, RR), pp. 15–22.
PODS-2012-Mahoney #data analysis #scalability: Approximate computation and implicit regularization for very large-scale data analysis (MWM), pp. 143–154.
VLDB-2012-MankuM #data type: Approximate Frequency Counts over Data Streams (GSM, RM), p. 1699.
DLT-J-2011-GaoY12 #complexity: State Complexity and Approximation (YG, SY), pp. 1085–1098.
ICALP-v1-2012-BuchbinderNRS #algorithm #constraints #online #rank: Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints (NB, JN, RR, MS), pp. 145–156.
ICALP-v1-2012-ByrkaR #algorithm: Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location (JB, BR), pp. 157–169.
ICALP-v1-2012-DinitzKR #scalability: Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner (MD, GK, RR), pp. 290–301.
ICALP-v1-2012-FellowsKRS: Parameterized Approximation via Fidelity Preserving Transformations (MRF, AK, FAR, HS), pp. 351–362.
ICALP-v1-2012-GharibianK #problem #quantum: Hardness of Approximation for Quantum Problems (SG, JK), pp. 387–398.
ICALP-v1-2012-GoldbergJ #complexity #polynomial: The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation) (LAG, MJ), pp. 399–410.
ICALP-v1-2012-GuptaN #integer #online #source code: Approximating Sparse Covering Integer Programs Online (AG, VN), pp. 436–448.
ICALP-v1-2012-HalldorssonSSW #clique #communication #complexity #streaming: Streaming and Communication Complexity of Clique Approximation (MMH, XS, MS, CW), pp. 449–460.
ICALP-v2-2012-AtseriasD #bound #quantifier: Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers (AA, AD), pp. 67–78.
LATA-2012-ChamparnaudJM #regular expression: Approximate Regular Expressions and Their Derivatives (JMC, HJ, LM), pp. 179–191.
ICGT-2012-GadducciLV #infinity #modelling: Exploiting Over- and Under-Approximations for Infinite-State Counterpart Models (FG, ALL, AV), pp. 51–65.
ICEIS-v1-2012-RudraGA #performance #query: An Efficient Sampling Scheme for Approximate Processing of Decision Support Queries (AR, RPG, NA), pp. 16–26.
CIKM-2012-GubichevN #graph #performance #scalability: Fast approximation of steiner trees in large graphs (AG, TN), pp. 1497–1501.
CIKM-2012-KimC #composition #dependence #functional #performance: Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient tensor decomposition (MK, KSC), pp. 355–364.
CIKM-2012-RahmanBH #algorithm #analysis #graph #named #scalability: GRAFT: an approximate graphlet counting algorithm for large graph analysis (MR, MB, MAH), pp. 1467–1471.
CIKM-2012-RiondatoDFU #algorithm #mining #named #parallel #pipes and filters #random: PARMA: a parallel randomized algorithm for approximate association rules mining in MapReduce (MR, JAD, RF, EU), pp. 85–94.
ICML-2012-MahoneyDMW #matrix #performance #statistics: Fast approximation of matrix coherence and statistical leverage (MWM, PD, MMI, DPW), p. 137.
ICML-2012-McCartin-LimMW: Approximate Principal Direction Trees (MML, AM, RW), p. 209.
ICML-2012-Petrik #bound #programming #robust: Approximate Dynamic Programming By Minimizing Distributionally Robust Bounds (MP), p. 207.
ICML-2012-RavanbakhshYG #modelling #visual notation: A Generalized Loop Correction Method for Approximate Inference in Graphical Models (S(R, CNY, RG), p. 84.
ICML-2012-ScherrerGGG #policy: Approximate Modified Policy Iteration (BS, VG, MG, MG), p. 245.
ICML-2012-ZhongG #approach #matrix: A Bayesian Approach to Approximate Joint Diagonalization of Square Matrices (MZ, MAG), p. 87.
ICPR-2012-ChenXF #using: Compression of GPS trajectories using optimized approximation (MC, MX, PF), pp. 3180–3183.
ICPR-2012-Havens #kernel #streaming: Approximation of kernel k-means for streaming data (TCH), pp. 509–512.
ICPR-2012-LinCKLL #adaptation: Adaptive support-window approximation to bilateral filtering (GSL, CYC, CTK, WNL, KCL), pp. 2013–2016.
ICPR-2012-LiuZR #algorithm: A direction Change-based algorithm for polygonal approximation (HL, XZ, AR), pp. 3586–3589.
ICPR-2012-SchleifZGH #clustering #kernel #performance #relational: Fast approximated relational and kernel clustering (FMS, XZ, AG, BH), pp. 1229–1232.
KDD-2012-PhamP #algorithm #detection: A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data (NP, RP), pp. 877–885.
KR-2012-ConitzerX #approach #multi: Paradoxes of Multiple Elections: An Approximation Approach (VC, LX).
KR-2012-LutzSW #approach #logic: An Automata-Theoretic Approach to Uniform Interpolation and Approximation in the Description Logic EL (CL, IS, FW).
PADL-2012-CampagnaSS #constraints #datalog #difference #optimisation: Optimizing Inequality Joins in Datalog with Approximated Constraint Propagation (DC, BSS, TS), pp. 108–122.
PLDI-2012-CarbinKMR #nondeterminism #proving #source code: Proving acceptability properties of relaxed nondeterministic approximate programs (MC, DK, SM, MCR), pp. 169–180.
POPL-2012-ZhuMKR #performance #program transformation #random: Randomized accuracy-aware program transformations for efficient approximate computations (ZAZ, SM, JAK, MCR), pp. 441–454.
SAC-2012-HuangHYY #algorithm #correlation #network: An in-network approximate data gathering algorithm exploiting spatial correlation in wireless sensor networks (CCH, JLH, JAY, LYY), pp. 550–555.
SAC-2012-LassaigneP #markov #process #scalability #verification: Approximate planning and verification for large markov decision processes (RL, SP), pp. 1314–1319.
SAC-2012-LibermanL: Approximately optimal facet selection (SL, RL), pp. 702–708.
SAC-2012-TriaLT #evaluation #metric #query: Metrics for approximate query engine evaluation (FDT, EL, FT), pp. 885–887.
SAC-2012-VirgilioR #biology #graph #rdf: Approximate matching over biological RDF graphs (RDV, SER), pp. 1413–1414.
ASPLOS-2012-EsmaeilzadehSCB #architecture #programming: Architecture support for disciplined approximate programming (HE, AS, LC, DB), pp. 301–312.
DAC-2012-KahngK #configuration management #design: Accuracy-configurable adder for approximate arithmetic designs (ABK, SK), pp. 820–825.
DAC-2012-VenkataramaniSKRR #logic #named #synthesis: SALSA: systematic logic synthesis of approximate circuits (SV, AS, VJK, KR, AR), pp. 796–801.
DATE-2012-MammoCPNZMB #simulation: Approximating checkers for simulation acceleration (BM, DC, DP, AN, AZ, RM, VB), pp. 153–158.
DATE-2012-StripfKB #architecture: A cycle-approximate, mixed-ISA simulator for the KAHRISMA architecture (TS, RK, JB), pp. 21–26.
DATE-2012-TodorovMRS #automation #memory management #transaction: Automated construction of a cycle-approximate transaction level model of a memory controller (VT, DMG, HR, US), pp. 1066–1071.
HPDC-2012-HefeedaGA #clustering #dataset #distributed #scalability: Distributed approximate spectral clustering for large-scale datasets (MH, FG, WAA), pp. 223–234.
STOC-2012-AbrahamCG #distance #graph: Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels (IA, SC, CG), pp. 1199–1218.
STOC-2012-BartalGK #polynomial #problem: The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme (YB, LAG, RK), pp. 663–672.
STOC-2012-ChalermsookCEL #algorithm #concurrent: Approximation algorithms and hardness of integral concurrent flow (PC, JC, AE, SL), pp. 689–708.
STOC-2012-DeDFS #parametricity #problem: Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces (AD, ID, VF, RAS), pp. 729–746.
STOC-2012-KelnerMP #multi #performance #using: Faster approximate multicommodity flow using quadratically coupled flows (JAK, GLM, RP), pp. 1–18.
STOC-2012-MakarychevMV #algorithm #clustering #problem: Approximation algorithms for semi-random partitioning problems (KM, YM, AV), pp. 367–384.
STOC-2012-OrecchiaSV #algorithm #exponential: Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator (LO, SS, NKV), pp. 1141–1160.
STOC-2012-SharathkumarA #algorithm #geometry: A near-linear time ε-approximation algorithm for geometric bipartite matching (RS, PKA), pp. 385–394.
TACAS-2012-AlbarghouthiGC: From Under-Approximations to Over-Approximations and Back (AA, AG, MC), pp. 157–172.
CAV-2012-MajumdarZ #modelling: Approximately Bisimilar Symbolic Models for Digital Control Systems (RM, MZ), pp. 362–377.
ICST-2012-TonellaMNJLH #execution #modelling: Finding the Optimal Balance between Over and Under Approximation of Models Inferred from Execution Logs (PT, AM, DCN, YJ, KL, MH), pp. 21–30.
LICS-2012-AgrawalAGT #markov #verification: Approximate Verification of the Symbolic Dynamics of Markov Chains (MA, SA, BG, PST), pp. 55–64.
SIGMOD-2011-LiDF #algorithm #named #performance: Faerie: efficient filtering algorithms for approximate dictionary-based entity extraction (GL, DD, JF), pp. 529–540.
SIGMOD-2011-SenellartS #lightweight #named #probability #query: ProApproX: a lightweight approximation query processor over probabilistic trees (PS, AS), pp. 1295–1298.
VLDB-2011-GeL #nondeterminism #string: Approximate Substring Matching over Uncertain Strings (TG, ZL), pp. 772–782.
CSMR-2011-VanyaPV #case study #set: Approximating Change Sets at Philips Healthcare: A Case Study (AV, RP, HvV), pp. 121–130.
WCRE-2011-BazrafshanKG #code search: Approximate Code Search in Program Histories (SB, RK, NG), pp. 109–118.
CIAA-J-2010-CzumajCGJLZ11 #algorithm #design #geometry #network: Approximation Algorithms for Buy-at-Bulk Geometric Network Design (AC, JC, LG, JJ, AL, PZ), pp. 1949–1969.
DLT-2011-YuG #complexity #research: State Complexity Research and Approximation (SY, YG), pp. 46–57.
ICALP-v1-2011-AdamaszekCLW #design #geometry #network: Approximation Schemes for Capacitated Geometric Network Design (AA, AC, AL, JOW), pp. 25–36.
ICALP-v1-2011-BermanBMRY #problem: Improved Approximation for the Directed Spanner Problem (PB, AB, KM, SR, GY), pp. 1–12.
ICALP-v1-2011-BorosEFGMM #analysis #game studies #probability: Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes (EB, KME, MF, VG, KM, BM), pp. 147–158.
ICALP-v1-2011-ChimaniH: A Tighter Insertion-Based Approximation of the Crossing Number (MC, PH), pp. 122–134.
ICALP-v1-2011-KawarabayashiKS #bound #distance #graph: Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (KiK, PNK, CS), pp. 135–146.
ICALP-v1-2011-Laekhanukit #algorithm #low cost #set: An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity — (BL), pp. 13–24.
ICALP-v1-2011-Moldenhauer #algorithm #graph: Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (CM), pp. 748–759.
ICALP-v1-2011-Varadaraja #problem: Buyback Problem — Approximate Matroid Intersection with Cancellation Costs (ABV), pp. 379–390.
ICALP-v2-2011-BrazdilBEK #game studies #probability #termination: Approximating the Termination Value of One-Counter MDPs and Stochastic Games (TB, VB, KE, AK), pp. 332–343.
ICALP-v2-2011-Li #algorithm #problem: A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem (SL), pp. 77–88.
TLCA-2011-RoweB #object-oriented #programming #semantics: Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming — (RNSR, SvB), pp. 229–244.
VS-Games-2011-Bashford-RogersDHC #interactive: Approximate Visibility Grids for Interactive Indirect Illumination (TBR, KD, CH, AC), pp. 55–62.
CIKM-2011-ElsayedLM #performance #retrieval: When close enough is good enough: approximate positional indexes for efficient ranked retrieval (TE, JJL, DM), pp. 1993–1996.
CIKM-2011-JangKFP #distance #linear: A linear-time approximation of the earth mover’s distance (MHJ, SWK, CF, SP), pp. 505–514.
CIKM-2011-KimC #algebra #composition #framework: Approximate tensor decomposition within a tensor-relational algebraic framework (MK, KSC), pp. 1737–1742.
CIKM-2011-TeodoroVMTM #adaptation #parallel #retrieval #similarity: Adaptive parallel approximate similarity search for responsive multimedia retrieval (GT, EV, NM, RdST, WMJ), pp. 495–504.
ICML-2011-CossalterYZ #adaptation #kernel #predict #scalability: Adaptive Kernel Approximation for Large-Scale Non-Linear SVM Prediction (MC, RY, LZ), pp. 409–416.
ICML-2011-DasK #algorithm #set #taxonomy: Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection (AD, DK), pp. 1057–1064.
ICML-2011-HannahD #problem #programming: Approximate Dynamic Programming for Storage Problems (LH, DBD), pp. 337–344.
ICML-2011-JegelkaB11a #bound #using: Approximation Bounds for Inference using Cooperative Cuts (SJ, JAB), pp. 577–584.
ICML-2011-KamisettyXL #correlation #using: Approximating Correlated Equilibria using Relaxations on the Marginal Polytope (HK, EPX, CJL), pp. 1153–1160.
ICML-2011-MahoneyO #implementation: Implementing regularization implicitly via approximate eigenvector computation (MWM, LO), pp. 121–128.
KDD-2011-AoyamaSSU #graph #performance #similarity: Fast approximate similarity search based on degree-reduced neighborhood graphs (KA, KS, HS, NU), pp. 1055–1063.
KDD-2011-ChittaJHJ #clustering #kernel #scalability: Approximate kernel k-means: solution to large scale kernel clustering (RC, RJ, TCH, AKJ), pp. 895–903.
SIGIR-2011-LinZD #documentation #optimisation: Best document selection based on approximate utility optimization (HHL, YZ, JD), pp. 1215–1216.
SIGIR-2011-ZhouCZ #algorithm #named #performance #string #towards: SEJoin: an optimized algorithm towards efficient approximate string searches (JZ, ZC, JZ), pp. 1249–1250.
OOPSLA-2011-MadhavanK #analysis #null #verification: Null dereference verification via over-approximated weakest pre-conditions analysis (RM, RK), pp. 1033–1052.
PLDI-2011-SampsonDFGCG #data type #named #power management: EnerJ: approximate data types for safe and general low-power computation (AS, WD, EF, DG, LC, DG), pp. 164–174.
SAS-2011-VerdoolaegeCB #integer #transitive #tuple: Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations (SV, AC, AB), pp. 216–232.
ASPLOS-2011-FarhadKBS #architecture #distributed #manycore #source code: Orchestration by approximation: mapping stream programs onto multicore architectures (SMF, YK, BB, BS), pp. 357–368.
DAC-2011-LiuDPC #composition #design #set: Supervised design space exploration by compositional approximation of Pareto sets (HYL, ID, MP, LPC), pp. 399–404.
DAC-2011-SunLT #analysis #grid #incremental #performance #power management: Efficient incremental analysis of on-chip power grid via sparse approximation (PS, XL, MYT), pp. 676–681.
DATE-2011-MohapatraCRR #design: Design of voltage-scalable meta-functions for approximate computing (DM, VKC, AR, KR), pp. 950–955.
PDP-2011-Csajbok #detection #set: Simultaneous Anomaly and Misuse Intrusion Detections Based on Partial Approximative Set Theory (ZC), pp. 651–655.
STOC-2011-AryaFM #query: Approximate polytope membership queries (SA, GDdF, DMM), pp. 579–586.
STOC-2011-ChristianoKMST #graph #performance: Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs (PC, JAK, AM, DAS, SHT), pp. 273–282.
STOC-2011-FeldmanL #clustering #framework: A unified framework for approximating and clustering data (DF, ML), pp. 569–578.
STOC-2011-KawarabayashiK #algorithm #problem: Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two (KiK, YK), pp. 81–88.
STOC-2011-KhotM #equation #linear #np-hard: NP-hardness of approximately solving linear equations over reals (SK, DM), pp. 413–420.
STOC-2011-SarmaHKKNPPW #distributed #verification: Distributed verification and hardness of distributed approximation (ADS, SH, LK, AK, DN, GP, DP, RW), pp. 363–372.
STOC-2011-Woodruff #black box #protocol: Near-optimal private approximation protocols via a black box transformation (DPW), pp. 735–744.
STOC-2011-Yoshida #algorithm #bound #csp: Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP (YY), pp. 665–674.
STOC-2011-ZewiB: From affine to two-source extractors via approximate duality (NZ, EBS), pp. 177–186.
CADE-2011-FredriksonCJ #algorithm #analysis #behaviour #complexity: Dynamic Behavior Matching: A Complexity Analysis and New Approximation Algorithms (MF, MC, SJ), pp. 252–267.
LICS-2011-AminofKL #automaton: Rigorous Approximated Determinization of Weighted Automata (BA, OK, RL), pp. 345–354.
TAP-2011-BueJM #generative #modelling #testing: Association of Under-Approximation Techniques for Generating Tests from Models (PCB, JJ, PAM), pp. 51–68.
PODS-2010-GeladeIMN #xml: Simplifying XML schema: single-type approximations of regular tree languages (WG, TI, WM, FN), pp. 251–260.
SIGMOD-2010-GiatrakosKDVT #named #network: TACO: tunable approximate computation of outliers in wireless sensor networks (NG, YK, AD, VV, YT), pp. 279–290.
SIGMOD-2010-MueenNL #correlation #performance: Fast approximate correlation for massive time-series data (AM, SN, JL), pp. 171–182.
VLDB-2010-ZhangYJ #graph #named #scalability: SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs (SZ, JY, WJ), pp. 1185–1194.
CSMR-2010-MarchettoTR #ajax #modelling: Under and Over Approximation of State Models Recovered for Ajax Applications (AM, PT, FR), pp. 236–239.
CIAA-2010-GerbushH #sequence: Approximating Minimum Reset Sequences (MG, BH), pp. 154–162.
ICALP-v1-2010-BhattacharyaDMT #on the: On Approximate Horn Formula Minimization (AB, BD, DM, GT), pp. 438–450.
ICALP-v1-2010-GamzuS: A Sublogarithmic Approximation for Highway and Tollbooth Pricing (IG, DS), pp. 582–593.
ICALP-v1-2010-GoldbergJ: Approximating the Partition Function of the Ferromagnetic Potts Model (LAG, MJ), pp. 396–407.
ICALP-v1-2010-GreveJLT #bound: Cell Probe Lower Bounds and Approximations for Range Mode (MG, AGJ, KDL, JT), pp. 605–616.
ICALP-v1-2010-GuptaNR10a #adaptation #algorithm #problem: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems (AG, VN, RR), pp. 690–701.
ICALP-v1-2010-Ito #proving: Polynomial-Space Approximation of No-Signaling Provers (TI), pp. 140–151.
ICALP-v1-2010-MakarychevMS #algorithm #polynomial #problem #reduction: Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm (KM, RM, MS), pp. 594–604.
ICALP-v2-2010-BansalJKN #algorithm #ranking: Approximation Algorithms for Diversified Search Ranking (NB, KJ, AK, JN), pp. 273–284.
CIKM-2010-CartrightALM #modelling #performance #query #using: Fast query expansion using approximations of relevance models (MAC, JA, VL, AM), pp. 1573–1576.
CIKM-2010-FangS #information retrieval #matrix #multi: Hypergraph-based multilevel matrix approximation for text information retrieval (HrF, YS), pp. 1597–1600.
CIKM-2010-LiSWZD #locality: Approximate membership localization (AML) for web-based join (ZL, LS, LW, XZ, XD), pp. 1321–1324.
ECIR-2010-CoxZFH #correctness #query #using: Improving Query Correctness Using Centralized Probably Approximately Correct (PAC) Search (IJC, JZ, RF, LKH), pp. 265–280.
ICML-2010-DinculescuP #predict: Approximate Predictive Representations of Partially Observable Systems (MD, DP), pp. 895–902.
ICML-2010-GregorL #learning #performance: Learning Fast Approximations of Sparse Coding (KG, YL), pp. 399–406.
ICML-2010-LiKL #scalability: Making Large-Scale Nyström Approximation Possible (ML, JTK, BLL), pp. 631–638.
ICML-2010-LongS #simulation #strict: Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate (PML, RAS), pp. 703–710.
ICML-2010-MaeiSBS #learning #towards: Toward Off-Policy Learning Control with Function Approximation (HRM, CS, SB, RSS), pp. 719–726.
ICML-2010-MeshiSJG #learning: Learning Efficiently with Approximate Inference via Dual Losses (OM, DS, TSJ, AG), pp. 783–790.
ICML-2010-MorimuraSKHT #learning #parametricity: Nonparametric Return Distribution Approximation for Reinforcement Learning (TM, MS, HK, HH, TT), pp. 799–806.
ICML-2010-PetrikTPZ #feature model #linear #markov #process #source code #using: Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes (MP, GT, RP, SZ), pp. 871–878.
ICPR-2010-Artigas-FuentesGB #mining #similarity: A High-Dimensional Access Method for Approximated Similarity Search in Text Mining (FJAF, RGG, JMBC), pp. 3155–3158.
ICPR-2010-Coeurjolly #performance: Fast and Accurate Approximation of the Euclidean Opening Function in Arbitrary Dimension (DC), pp. 229–232.
ICPR-2010-FausserS #learning: Learning a Strategy with Neural Approximated Temporal-Difference Methods in English Draughts (SF, FS), pp. 2925–2928.
ICPR-2010-FerrerB #algorithm #graph: An Iterative Algorithm for Approximate Median Graph Computation (MF, HB), pp. 1562–1565.
ICPR-2010-Ogawara: Approximate Belief Propagation by Hierarchical Averaging of Outgoing Messages (KO), pp. 1368–1372.
ICPR-2010-TakahashiK #classification: Margin Preserved Approximate Convex Hulls for Classification (TT, MK), pp. 4052–4055.
ICPR-2010-ZhouL #monte carlo #optimisation #performance: Efficient Polygonal Approximation of Digital Curves via Monte Carlo Optimization (XZ, YL), pp. 3513–3516.
KDIR-2010-ParviainenRML #infinity #learning #network: Interpreting Extreme Learning Machine as an Approximation to an Infinite Neural Network (EP, JR, YM, AL), pp. 65–73.
KEOD-2010-MazakSL #heuristic #ontology: align++ — A Heuristic-based Method for Approximating the Mismatch-at-Risk in Schema-based Ontology Alignment (AM, BS, ML), pp. 17–26.
SIGIR-2010-Huerta #approach #stack #string: A stack decoder approach to approximate string matching (JMH), pp. 823–824.
PEPM-2010-AndersonK #bound #termination: Regular approximation and bounded domains for size-change termination (HA, SCK), pp. 53–62.
PLDI-2010-BaekC #energy #framework #named #programming #using: Green: a framework for supporting energy-conscious programming using controlled approximation (WB, TMC), pp. 198–209.
POPL-2010-HoborDA #formal method: A theory of indirection via approximation (AH, RD, AWA), pp. 171–184.
QAPL-2010-Aldini #behaviour #equivalence #probability #testing: Approximate Testing Equivalence Based on Time, Probability, and Observed Behavior (AA), pp. 1–15.
SAC-2010-MarascuML #performance #set #streaming: A fast approximation strategy for summarizing a set of streaming time series (AM, FM, YL), pp. 1617–1621.
SAC-2010-ZhouSS #design #geometry: Blade geometry design with kinematic ruled surface approximation (YZ, JS, SS), pp. 1266–1267.
DAC-2010-WangM #named #realtime #scalability #using: PreDVS: preemptive dynamic voltage scaling for real-time systems using approximation scheme (WW, PM), pp. 705–710.
DATE-2010-ShinG #fault #logic #synthesis: Approximate logic synthesis for error tolerant applications (DS, SKG), pp. 957–960.
LCTES-2010-LiXLZ #analysis #architecture #memory management: Analysis and approximation for bank selection instruction minimization on partitioned memory architecture (ML, CJX, TL, YZ), pp. 1–8.
STOC-2010-BateniHM #bound #graph: Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth (MB, MH, DM), pp. 211–220.
STOC-2010-BhaskaraCCFV #detection: Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph (AB, MC, EC, UF, AV), pp. 201–210.
STOC-2010-ByrkaGRS: An improved LP-based approximation for steiner tree (JB, FG, TR, LS), pp. 583–592.
STOC-2010-GilbertLPS #metric #optimisation: Approximate sparse recovery: optimizing time and measurements (ACG, YL, EP, MJS), pp. 475–484.
STOC-2010-Madry #algorithm #graph #multi #performance #problem: Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms (AM), pp. 121–130.
STOC-2010-RaghavendraST #graph #parametricity: Approximations for the isoperimetric and spectral profile of graphs and related parameters (PR, DS, PT), pp. 631–640.
TACAS-2010-LegrielGCM #multi #optimisation #problem: Approximating the Pareto Front of Multi-criteria Optimization Problems (JL, CLG, SC, OM), pp. 69–83.
CAV-2010-GantyMM #bound: Bounded Underapproximations (PG, RM, BM), pp. 600–614.
ICLP-2010-Maher10 #constraints: Contractibility and Contractible Approximations of Soft Global Constraints (MJM), pp. 114–123.
ICDAR-2009-Takasu #estimation #similarity: Bayesian Similarity Model Estimation for Approximate Recognized Text Search (AT), pp. 611–615.
SIGMOD-2009-HadjieleftheriouKS #incremental #maintenance #normalisation #string: Incremental maintenance of length normalized indexes for approximate string matching (MH, NK, DS), pp. 429–440.
SIGMOD-2009-WangXLZ #constraints #distance #edit distance #performance: Efficient approximate entity extraction with edit distance constraints (WW, CX, XL, CZ), pp. 759–770.
VLDB-2009-ChaudhuriGX #documentation #mining: Mining Document Collections to Facilitate Accurate Approximate Entity Matching (SC, VG, DX), pp. 395–406.
VLDB-2009-ElmeleegyECAZ #linear #online #precise: Online Piece-wise Linear Approximation of Numerical Streams with Precision Guarantees (HE, AKE, EC, WGA, WZ), pp. 145–156.
VLDB-2009-HadjieleftheriouL #performance #string: Efficient Approximate Search on String Collections (MH, CL), pp. 1660–1661.
VLDB-2009-LiuLGF #network #query: Enabling epsilon-Approximate Querying in Sensor Networks (YL, JL, HG, XF), pp. 169–180.
VLDB-2009-ZengTWFZ #distance #edit distance #graph: Comparing Stars: On Approximating Graph Edit Distance (ZZ, AKHT, JW, JF, LZ), pp. 25–36.
WCRE-1999-Kpodjedo99a #graph #re-engineering: Approximate Graph Matching in Software Engineering (SK), pp. 295–298.
CIAA-2009-CourbisHK #model checking: TAGED Approximations for Temporal Properties Model-Checking (RC, PCH, OK), pp. 135–144.
DLT-2009-Egecioglu #context-free grammar: Strongly Regular Grammars and Regular Approximation of Context-Free Languages (ÖE), pp. 207–220.
ICALP-v1-2009-Amano #bound: Bounds on the Size of Small Depth Circuits for Approximating Majority (KA), pp. 59–70.
ICALP-v1-2009-ChakaravarthyPRS #branch #multi: Approximating Decision Trees with Multiway Branches (VTC, VP, SR, YS), pp. 210–221.
ICALP-v1-2009-ChenIKMR: Approximating Matches Made in Heaven (NC, NI, ARK, MM, AR), pp. 266–278.
ICALP-v1-2009-CyganP: Exact and Approximate Bandwidth (MC, MP), pp. 304–315.
ICALP-v1-2009-DemaineHK #algorithm #graph: Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs (EDD, MH, KiK), pp. 316–327.
ICALP-v1-2009-KoufogiannakisY #algorithm #constraints: Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost (CK, NEY), pp. 634–652.
ICALP-v1-2009-McDermid #algorithm: A 3/2-Approximation Algorithm for General Stable Marriage (EM), pp. 689–700.
ICALP-v2-2009-ChaputDPP #markov #process: Approximating Markov Processes by Averaging (PC, VD, PP, GDP), pp. 127–138.
ICEIS-J-2009-Cuzzocrea #evaluation #named #probability #query #reduction #scalability: s-OLAP: Approximate OLAP Query Evaluation on Very Large Data Warehouses via Dimensionality Reduction and Probabilistic Synopses (AC), pp. 248–262.
CIKM-2009-LuHM #algorithm #performance #using: Efficient algorithms for approximate member extraction using signature-based inverted lists (JL, JH, XM), pp. 315–324.
ICML-2009-KumarMT #composition #on the: On sampling-based approximate spectral decomposition (SK, MM, AT), pp. 553–560.
ICML-2009-LangT #probability #relational: Approximate inference for planning in stochastic relational worlds (TL, MT), pp. 585–592.
ICML-2009-MartinsSX #natural language #parsing: Polyhedral outer approximations with application to natural language parsing (AFTM, NAS, EPX), pp. 713–720.
ICML-2009-PetrikZ #constraints #linear #source code: Constraint relaxation in approximate linear programs (MP, SZ), pp. 809–816.
ICML-2009-SuttonMPBSSW #learning #linear #performance: Fast gradient-descent methods for temporal-difference learning with linear function approximation (RSS, HRM, DP, SB, DS, CS, EW), pp. 993–1000.
ICML-2009-TaylorP #kernel #learning: Kernelized value function approximation for reinforcement learning (GT, RP), pp. 1017–1024.
ICML-2009-Toussaint #optimisation #using: Robot trajectory optimization using approximate inference (MT), pp. 1049–1056.
KDD-2009-TantipathananandhB #algorithm #community #identification: Constant-factor approximation algorithms for identifying dynamic communities (CT, TYBW), pp. 827–836.
KDD-2009-YanHJ #clustering #performance: Fast approximate spectral clustering (DY, LH, MIJ), pp. 907–916.
KEOD-2009-TsalapatiSK #ontology #problem #reuse: A Method for Approximation to Ontology Reuse Problem (ET, GBS, GK), pp. 416–419.
SIGIR-2009-ZhangHS #modelling: Approximating true relevance distribution from a mixture model based on irrelevance data (PZ, YH, DS), pp. 107–114.
PEPM-2009-SimmonsP #linear #logic: Linear logical approximations (RJS, FP), pp. 9–20.
SAC-2009-LeeKLY #database #network: Approximate indexing in road network databases (SCL, SWK, JL, JSY), pp. 1568–1572.
SAC-2009-ShenU #composition #concept #matrix #multi: A class of multistep sparse matrix strategies for concept decomposition matrix approximation (CS, MU), pp. 1714–1718.
SAC-2009-YangLLW #approach #constraints #theorem proving: An approximate approach to constraint solving in soft sensing (TY, ZL, XL, HW), pp. 1415–1416.
ASPLOS-2009-TamASS #named #online #optimisation: RapidMRC: approximating L2 miss rate curves on commodity systems for online optimizations (DKT, RA, LS, MS), pp. 121–132.
CGO-2009-SerranoZ: Building Approximate Calling Context from Partial Call Traces (MJS, XZ), pp. 221–230.
DAC-2009-GhaniN #grid #performance #power management #using #verification: Fast vectorless power grid verification using an approximate inverse technique (NHAG, FNN), pp. 184–189.
DAC-2009-HuLA #polynomial: A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion (SH, ZL, CJA), pp. 424–429.
DATE-2009-YangCKT #energy #multi #realtime #scheduling: An approximation scheme for energy-efficient scheduling of real-time tasks in heterogeneous multiprocessor systems (CYY, JJC, TWK, LT), pp. 694–699.
DATE-2009-YangSVBS #logic: Sequential logic rectifications with approximate SPFDs (YSY, SS, AGV, RKB, DES), pp. 1698–1703.
STOC-2009-AndoniO #distance #edit distance: Approximating edit distance in near-linear time (AA, KO), pp. 199–204.
STOC-2009-GuptaK #probability: A constant-factor approximation for stochastic Steiner forest (AG, AK), pp. 659–668.
STOC-2009-KarpinskiS #game studies #linear #problem: Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems (MK, WS), pp. 313–322.
STOC-2009-NguyenDT #algorithm #matrix #performance #rank: A fast and efficient algorithm for low-rank approximation of a matrix (NHN, TTD, TDT), pp. 215–224.
STOC-2009-YoshidaYI #algorithm: An improved constant-time approximation algorithm for maximum~matchings (YY, MY, HI), pp. 225–234.
LICS-2009-GhicaB #named #semantics: Clipping: A Semantics-Directed Syntactic Approximation (DRG, AB), pp. 189–198.
PODS-2008-AnagnostopoulosDK #algorithm #clustering: Approximation algorithms for co-clustering (AA, AD, RK), pp. 201–210.
PODS-2008-CormodeM #algorithm #clustering #nondeterminism: Approximation algorithms for clustering uncertain data (GC, AM), pp. 191–200.
PODS-2008-Koch #database #probability #query: Approximating predicates and expressive queries on probabilistic databases (CK), pp. 99–108.
SIGMOD-2008-AthitsosPPKG #sequence: Approximate embedding-based subsequence matching of time series (VA, PP, MP, GK, DG), pp. 365–378.
SIGMOD-2008-ChakrabartiCGX #performance: An efficient filter for approximate membership checking (KC, SC, VG, DX), pp. 805–818.
SIGMOD-2008-YangWL #cost analysis #query #string: Cost-based variable-length-gram selection for string collections to support approximate queries efficiently (XY, BW, CL), pp. 353–364.
VLDB-2008-DeyBDH #diagrams #query: Efficiently approximating query optimizer plan diagrams (AD, SB, HD, JRH), pp. 1325–1336.
VLDB-2008-ReS #database #probability: Approximate lineage for probabilistic databases (CR, DS), pp. 797–808.
DLT-J-2007-BertoniR08 #monad: Approximating the Mean Speedup in Trace Monoids (AB, RR), pp. 497–511.
DLT-J-2007-OchemRS08: Avoiding Approximate Squares (PO, NR, JS), pp. 633–648.
CIAA-2008-SimunekM #distance: Approximate Periods with Levenshtein Distance (MS, BM), pp. 286–287.
ICALP-A-2008-AzarBKMN #algorithm: Improved Approximation Algorithms for Budgeted Allocations (YA, BEB, ARK, CM, CTN), pp. 186–197.
ICALP-A-2008-DietzfelbingerP #data type #retrieval: Succinct Data Structures for Retrieval and Approximate Membership (MD, RP), pp. 385–396.
ICALP-A-2008-EsparzaGKS #equation: Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations (JE, TG, SK, HS), pp. 698–710.
ICALP-A-2008-JansenT #algorithm #parallel #scheduling: Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 (KJ, RT), pp. 234–245.
ICALP-A-2008-KaoS #random #self: Randomized Self-assembly for Approximate Shapes (MYK, RTS), pp. 370–384.
ICALP-A-2008-Kawarabayashi: Approximating List-Coloring on a Fixed Surface (KiK), pp. 333–344.
ICALP-A-2008-LaberM #algorithm: An Approximation Algorithm for Binary Searching in Trees (ESL, MM), pp. 459–471.
ICALP-A-2008-Phillips #algorithm: Algorithms for epsilon-Approximations of Terrains (JMP), pp. 447–458.
FM-2008-FuriaPR #automation #specification #verification: Automated Verification of Dense-Time MTL Specifications Via Discrete-Time Approximation (CAF, MP, MR), pp. 132–147.
RTA-2008-BoichutCHK #abstraction #refinement: Finer Is Better: Abstraction Refinement for Rewriting Approximations (YB, RC, PCH, OK), pp. 48–62.
SEFM-2008-FranzleH #calculus #model checking #performance: Efficient Model Checking for Duration Calculus Based on Branching-Time Approximations (MF, MRH), pp. 63–72.
GT-VC-2007-Pennemann08 #algorithm #problem #satisfiability: An Algorithm for Approximating the Satisfiability Problem of High-level Conditions (KHP), pp. 75–94.
ICEIS-AIDSS-2008-AjroudOBY #algorithm #network: An Approximate Propagation Algorithm for Product-Based Possibilistic Networks (AA, MNO, SB, HY), pp. 321–326.
CIKM-2008-Bar-YossefM #rank: Local approximation of pagerank and reverse pagerank (ZBY, LTM), pp. 279–288.
CIKM-2008-ShawXG #dataset: Deriving non-redundant approximate association rules from hierarchical datasets (GS, YX, SG), pp. 1451–1452.
CIKM-2008-StroeBNP #approach #string: An approximate string matching approach for handling incorrectly typed urls (MS, RB, CN, DP), pp. 1339–1340.
ICML-2008-Li #comparison #difference #linear #worst-case: A worst-case comparison between temporal difference and residual gradient with linear function approximation (LL), pp. 560–567.
ICML-2008-LoeffFR #learning #named: ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning (NL, DAF, DR), pp. 600–607.
ICML-2008-MeloMR #analysis #learning: An analysis of reinforcement learning with function approximation (FSM, SPM, MIR), pp. 664–671.
ICML-2008-ParrLTPL #analysis #feature model #learning #linear #modelling: An analysis of linear models, linear value-function approximation, and feature selection for reinforcement learning (RP, LL, GT, CPW, MLL), pp. 752–759.
ICML-2008-Tieleman #strict #using: Training restricted Boltzmann machines using approximations to the likelihood gradient (TT), pp. 1064–1071.
ICML-2008-YamanWLd #modelling: Democratic approximation of lexicographic preference models (FY, TJW, MLL, Md), pp. 1200–1207.
ICML-2008-ZhangTK #analysis #fault #rank: Improved Nyström low-rank approximation and error analysis (KZ, IWT, JTK), pp. 1232–1239.
ICPR-2008-FerrerVSRB #algorithm #graph #using: An approximate algorithm for median graph computation using graph embedding (MF, EV, FS, KR, HB), pp. 1–4.
ICPR-2008-GorisseCPP #image #kernel #performance #retrieval #similarity: Fast approximate kernel-based similarity search for image retrieval task (DG, MC, FP, SPF), pp. 1–4.
ICPR-2008-HautamakiNF #clustering #prototype: Time-series clustering by approximate prototypes (VH, PN, PF), pp. 1–4.
ICPR-2008-HuangST08a: Approximation of salient contours in cluttered scenes (RH, NS, QT), pp. 1–4.
KDD-2008-GuptaFFSK #algorithm #evaluation #mining: Quantitative evaluation of approximate frequent pattern mining algorithms (RG, GF, BF, MS, VK), pp. 301–309.
KR-2008-Cortes-CalabuigDAB #database #fixpoint #performance #query: Accuracy and Efficiency of Fixpoint Methods for Approximate Query Answering in Locally Complete Databases (ACC, MD, OA, MB), pp. 81–91.
KR-2008-WittocxMD #first-order #logic #reasoning: Approximate Reasoning in First-Order Logic Theories (JW, MM, MD), pp. 103–112.
SIGIR-2008-Bar-YossefM #rank: Local approximation of PageRank and reverse PageRank (ZBY, LTM), pp. 865–866.
SIGIR-2008-ZimmerTW #correlation #information management #keyword: Exploiting correlated keywords to improve approximate information filtering (CZ, CT, GW), pp. 323–330.
QAPL-2008-Bortolussi #concurrent #constraints #equation #on the #probability #programming: On the Approximation of Stochastic Concurrent Constraint Programming by Master Equation (LB), pp. 163–180.
SAC-2008-DornS #3d #named #predict: CReF: a central-residue-fragment-based method for predicting approximate 3-D polypeptides structures (MD, ONdS), pp. 1261–1267.
SAC-2008-GoldsztejnMR #algorithm #performance #quantifier: An efficient algorithm for a sharp approximation of universally quantified inequalities (AG, CM, MR), pp. 134–139.
SAC-2008-MowatSSC #network #peer-to-peer: Extending peer-to-peer networks for approximate search (AM, RS, MS, IC), pp. 455–459.
DATE-2008-ChoudhuryM #concurrent #detection #fault #logic: Approximate logic circuits for low overhead, non-intrusive concurrent error detection (MRC, KM), pp. 903–908.
DATE-2008-FangH #algorithm #performance #satisfiability: A Fast Approximation Algorithm for MIN-ONE SAT (LF, MSH), pp. 1087–1090.
DATE-2008-HashemiG #algorithm #pipes and filters #synthesis: Exact and Approximate Task Assignment Algorithms for Pipelined Software Synthesis (MH, SG), pp. 746–751.
DATE-2008-HwangAG #estimation #performance #transaction: Cycle-approximate Retargetable Performance Estimation at the Transaction Level (YH, SA, DG), pp. 3–8.
DATE-2008-KazmierskiZA #mobile #modelling #performance #using: Efficient circuit-level modelling of ballistic CNT using piecewise non-linear approximation of mobile charge density (TJK, DZ, BMAH), pp. 146–151.
HPDC-2008-HeSWF #automation #performance #recognition #test coverage: Code coverage, performance approximation and automatic recognition of idioms in scientific applications (JH, AS, RFVdW, MAF), pp. 223–224.
ISMM-2008-ZhongC #locality: Sampling-based program locality approximation (YZ, WC), pp. 91–100.
STOC-2008-DaitchS #algorithm #performance: Faster approximate lossy generalized flow via interior point algorithms (SID, DAS), pp. 451–460.
STOC-2008-FakcharoenpholL #algorithm #problem: An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem (JF, BL), pp. 153–158.
STOC-2008-LauS #bound #design #network: Additive approximation for bounded degree survivable network design (LCL, MS), pp. 759–768.
STOC-2008-Vondrak #problem: Optimal approximation for the submodular welfare problem in the value oracle model (JV), pp. 67–74.
VMCAI-2008-DSilvaPK #model checking #refinement: Approximation Refinement for Interpolation-Based Model Checking (VD, MP, DK), pp. 68–82.
DocEng-2007-HurstM: Approximating text by its area (NH, KM), pp. 147–150.
ICDAR-2007-CharW #functional #representation: Representing and Characterizing Handwritten Mathematical Symbols through Succinct Functional Approximation (BWC, SMW), pp. 1198–1202.
PODS-2007-ChakaravarthyPRAM #algorithm #identification: Decision trees for entity identification: approximation algorithms and hardness results (VTC, VP, SR, PA, MKM), pp. 53–62.
SIGMOD-2007-ChandelHKSS #benchmark #declarative #metric: Benchmarking declarative approximate selection predicates (AC, OH, NK, MS, DS), pp. 353–364.
SIGMOD-2007-JermaineAPD #query #scalability: Scalable approximate query processing with the DBO engine (CMJ, SA, AP, AD), pp. 725–736.
SIGMOD-2007-ParkS #algorithm: Approximate algorithms for K-anonymity (HP, KS), pp. 67–78.
VLDB-2007-LiH #mining #multi: Mining Approximate Top-K Subspace Anomalies in Multi-Dimensional Time-Series Data (XL, JH), pp. 447–458.
VLDB-2007-LiWY #named #performance #query #string #using: VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams (CL, BW, XY), pp. 303–314.
SCAM-2007-MolinaS #open source #performance #source code #using: Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes (AJMM, TS), pp. 111–122.
DLT-2007-KriegerORS: Avoiding Approximate Squares (DK, PO, NR, JS), pp. 278–289.
ICALP-2007-IshaiMSW #multi: Private Multiparty Sampling and Approximation of Vector Combinations (YI, TM, MJS, RNW), pp. 243–254.
ICALP-2007-KontogiannisS #algorithm #constant #game studies #performance: Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games (SCK, PGS), pp. 595–606.
ICALP-2007-ODonnellW: Approximation by DNF: Examples and Counterexamples (RO, KW), pp. 195–206.
LATA-2007-IliopoulosJMS #pattern matching: Weighted Degenerated Approximate Pattern Matching (CSI, IJ, BM, JS), pp. 285–296.
LATA-2007-OgasawaraK #performance #product line: Stochastically Approximating Tree Grammars by Regular Grammars and Its Application to Faster ncRNA Family Annotation (KO, SK), pp. 461–472.
RTA-2007-BoichutGJR #performance #prototype: Rewriting Approximations for Fast Prototyping of Static Analyzers (YB, TG, TPJ, LLR), pp. 48–62.
CIKM-2007-DornelesHOSM: A strategy for allowing meaningful and comparable scores in approximate matching (CFD, CAH, VMO, ASdS, ESdM), pp. 303–312.
CIKM-2007-ZhangW #algorithm #data type #performance: An efficient algorithm for approximate biased quantile computation in data streams (QZ, WW), pp. 1023–1026.
ICML-2007-JohnsM #graph: Constructing basis functions from directed graphs for value function approximation (JJ, SM), pp. 385–392.
ICML-2007-ParrPLL #generative: Analyzing feature generation for value-function approximation (RP, CPW, LL, MLL), pp. 737–744.
ICML-2007-PhuaF #learning #linear: Tracking value function dynamics to improve reinforcement learning with piecewise linear function approximation (CWP, RF), pp. 751–758.
ICML-2007-TsampoukaS #algorithm: Approximate maximum margin algorithms with rules controlled by the number of mistakes (PT, JST), pp. 903–910.
POPL-2007-ShenSMD #locality #using: Locality approximation using time (XS, JS, BM, CD), pp. 55–61.
SAS-2007-GoubaultP: Under-Approximations of Computations in Real Numbers Based on Generalized Affine Arithmetic (EG, SP), pp. 137–152.
SAC-2007-JohnsB #automation #injection #named #web: SMask: preventing injection attacks in web applications by approximating automatic data/code separation (MJ, CB), pp. 284–291.
SAC-2007-PigeauNG #image #performance: Fast tracking of hierarchical partitions with approximate kl-divergence for geo-temporal organization of personal images (AP, AN, MG), pp. 1088–1089.
SAC-2007-XingXE #automation #documentation #using #xml: Building automatic mapping between XML documents using approximate tree matching (GX, ZX, AE), pp. 525–526.
CASE-2007-Gonzalez-CastoloL #fuzzy #petri net #using: Approximating State of DES Using Fuzzy Timed Petri Nets (JCGC, ELM), pp. 722–728.
CASE-2007-WangL #analysis #modelling #reliability: Approximate Analysis of Re-Entrant Lines with Bernoulli Reliability Models (CW, JL), pp. 398–403.
DAC-2007-LiuLC #algorithm #multi #optimisation #using: A Provably Good Approximation Algorithm for Power Optimization Using Multiple Supply Voltages (HYL, WPL, YWC), pp. 887–890.
DAC-2007-OstlerC #algorithm #architecture #concurrent #multi #network #thread: Approximation Algorithm for Data Mapping on Block Multi-threaded Network Processor Architectures (CO, KSC), pp. 801–804.
FoSSaCS-2007-BreugelSW #behaviour #probability #pseudo: Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems (FvB, BS, JW), pp. 123–137.
STOC-2007-AgarwalAC #problem: Improved approximation for directed cut problems (AA, NA, MC), pp. 671–680.
STOC-2007-AsadpourS #algorithm: An approximation algorithm for max-min fair allocation of indivisible goods (AA, AS), pp. 114–121.
STOC-2007-BayatiGKNT #algorithm: Simple deterministic approximation algorithms for counting matchings (MB, DG, DAK, CN, PT), pp. 122–127.
STOC-2007-DeshpandeV #reduction: Sampling-based dimension reduction for subspace approximation (AD, KRV), pp. 641–650.
STOC-2007-GuhaM #algorithm #learning #problem: Approximation algorithms for budgeted learning problems (SG, KM), pp. 104–113.
STOC-2007-KakadeKL #algorithm #game studies: Playing games with approximation algorithms (SMK, ATK, KL), pp. 546–555.
STOC-2007-SinghL #bound: Approximating minimum bounded degree spanning trees to within one of optimal (MS, LCL), pp. 661–670.
CAV-2007-MatsliahS #encryption #model checking #random: Underapproximation for Model-Checking Based on Random Cryptographic Constructions (AM, OS), pp. 339–351.
ICLP-2007-Nguyen #complexity #knowledge base #logic: Approximating Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity (LAN), pp. 438–439.
VMCAI-2007-BallK #source code: Better Under-Approximation of Programs by Hiding Variables (TB, OK), pp. 314–328.
PODS-2006-GuhaM #order: Approximate quantiles and the order of the stream (SG, AM), pp. 273–279.
PODS-2006-KimelfeldS #keyword #proximity: Finding and approximating top-k answers in keyword proximity search (BK, YS), pp. 173–182.
SIGMOD-2006-DengR #detection #streaming #using: Approximately detecting duplicates for streaming data using stable bloom filters (FD, DR), pp. 25–36.
SIGMOD-2006-ZuzarteY #performance #statistics: Fast approximate computation of statistics on views (CZ, XY), p. 724.
VLDB-2006-ApaydinCFT #encoding #query: Approximate Encoding for Direct Access and Query Processing over Compressed Bitmaps (TA, GC, HF, AST), pp. 846–857.
VLDB-2006-AugstenBG #incremental: An Incrementally Maintainable Index for Approximate Lookups in Hierarchical Data (NA, MHB, JG), pp. 247–258.
VLDB-2006-KanneM #algorithm #clustering #linear: A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix (CCK, GM), pp. 91–102.
VLDB-2006-PandaRPGC: Indexing for Function Approximation (BP, MR, SBP, JG, LPC), pp. 523–534.
VLDB-2006-ParreiraDMW #distributed #network #peer-to-peer #performance #rank #web: Efficient and Decentralized PageRank Approximation in a Peer-to-Peer Web Search Network (JXP, DD, SM, GW), pp. 415–426.
VLDB-2006-SpiegelPBP #named #query #xml: AQAX: A System for Approximate XML Query Answers (JS, EDP, SB, NP), pp. 1159–1162.
SCAM-2006-BinkleyHK #animation #static analysis: Characterising, Explaining, and Exploiting the Approximate Nature of Static Analysis through Animation (DB, MH, JK), pp. 43–52.
CIAA-2006-Hyyro #automaton #nondeterminism #string: Tighter Packed Bit-Parallel NFA for Approximate String Matching (HH), pp. 287–289.
ICALP-v1-2006-AlonSS #problem: Additive Approximation for Edge-Deletion Problems (NA, AS, BS), pp. 1–2.
ICALP-v1-2006-BordewichDK #metric: Stopping Times, Metrics and Approximate Counting (MB, MED, MK), pp. 108–119.
ICALP-v1-2006-ChaudhuriRRT #algorithm #bound: A Push-Relabel Algorithm for Approximating Degree Bounded MSTs (KC, SR, SR, KT), pp. 191–201.
ICALP-v1-2006-Fujito #algorithm #how: How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover (TF), pp. 431–442.
ICALP-v1-2006-Harren #orthogonal #problem: Approximating the Orthogonal Knapsack Problem for Hypercubes (RH), pp. 238–249.
ICALP-v1-2006-KortsarzN #algorithm #problem: Tight Approximation Algorithm for Connectivity Augmentation Problems (GK, ZN), pp. 443–452.
ICALP-v1-2006-RaviS #algorithm: Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs (RR, MS), pp. 169–180.
FM-2006-DonaldsonM #model checking #reduction #symmetry: Exact and Approximate Strategies for Symmetry Reduction in Model Checking (AFD, AM), pp. 541–556.
RTA-2006-BoichutG #re-engineering: Feasible Trace Reconstruction for Rewriting Approximations (YB, TG), pp. 123–135.
CIKM-2006-AchtertBKKPR #metric #nearest neighbour #query: Approximate reverse k-nearest neighbor queries in general metric spaces (EA, CB, PK, PK, AP, MR), pp. 788–789.
CIKM-2006-GollapudiP06a #string #taxonomy: A dictionary for approximate string search and longest prefix search (SG, RP), pp. 768–775.
CIKM-2006-OjewoleZH #data type #semantics: Window join approximation over data streams with importance semantics (AO, QZ, WCH), pp. 112–121.
CIKM-2006-Takasu #algorithm #documentation #multi #retrieval #robust: An approximate multi-word matching algorithm for robust document retrieval (AT), pp. 34–42.
ECIR-2006-Osinski #clustering #matrix #quality: Improving Quality of Search Results Clustering with Approximate Matrix Factorisations (SO), pp. 167–178.
ICML-2006-Elkan #clustering #documentation #multi: Clustering documents with an exponential-family approximation of the Dirichlet compound multinomial distribution (CE), pp. 289–296.
ICML-2006-GeJ #consistency #multi: A note on mixtures of experts for multiclass responses: approximation rate and Consistent Bayesian Inference (YG, WJ), pp. 329–335.
ICML-2006-KellerMP #automation #learning #programming: Automatic basis function construction for approximate dynamic programming and reinforcement learning (PWK, SM, DP), pp. 449–456.
ICML-2006-LeordeanuH #energy #performance: Efficient MAP approximation for dense energy functions (ML, MH), pp. 545–552.
ICPR-v2-2006-LocteauRALHT #algorithm #multi #search-based #using: Approximation of Digital Curves using a Multi-Objective Genetic Algorithm (HL, RR, SA, YL, PH, ÉT), pp. 716–719.
ICPR-v2-2006-Mainar-RuizP #multi #nearest neighbour #using: Approximate Nearest Neighbor Search using a Single Space-filling Curve and Multiple Representations of the Data Points (GMR, JCPC), pp. 502–505.
ICPR-v3-2006-ChanL #algorithm #fault #multi #performance: Multiplierless Fast DCT Algorithms with Minimal Approximation Errors (RKWC, MCL), pp. 921–925.
ICPR-v3-2006-ShiG #image: Fingerprint Image Enhancement Based on Skin Profile Approximation (ZS, VG), pp. 714–717.
ICPR-v4-2006-PhamS #classification #clustering #metric #performance: Metric tree partitioning and Taylor approximation for fast support vector classification (TVP, AWMS), pp. 132–135.
KDD-2006-AgarwalMPVZ #performance #statistics: Spatial scan statistics: approximations and performance study (DA, AM, JMP, SV, ZZ), pp. 24–33.
KDD-2006-RattiganMJ #network #performance #using: Using structure indices for efficient approximation of network properties (MJR, MEM, DJ), pp. 357–366.
KDD-2006-WuCCH #incremental #matrix: Incremental approximate matrix factorization for speeding up support vector machines (GW, EYC, YKC, CJH), pp. 760–766.
KR-2006-SonT #on the #reasoning: On the Completeness of Approximation Based Reasoning and Planning in Action Theories with Incomplete Information (TCS, PHT), pp. 481–491.
SAS-2006-Schmidt: Underapproximating Predicate Transformers (DAS), pp. 127–143.
SAC-2006-Goldsztejn #algorithm #branch #set: A branch and prune algorithm for the approximation of non-linear AE-solution sets (AG), pp. 1650–1654.
SAC-2006-GrandonG #constraints #distance #parametricity #quantifier: Inner approximation of distance constraints with existential quantification of parameters (CG, AG), pp. 1660–1661.
CASE-2006-LopatinY #algorithm #polynomial #using: Using the forward search and the polynomial approximation algorithms in the exact algorithm for manipulator’s control in an unknown environment (PKL, ASY), pp. 206–211.
HPDC-2006-GaoSC: Path Grammar Guided Trace Compression and Trace Approximation (XG, AS, LC), pp. 57–68.
STOC-2006-AharonovJL #algorithm #polynomial #quantum: A polynomial quantum algorithm for approximating the Jones polynomial (DA, VJ, ZL), pp. 427–436.
STOC-2006-AilonC #nearest neighbour #performance: Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform (NA, BC), pp. 557–563.
STOC-2006-AroraC: New approximation guarantee for chromatic number (SA, EC), pp. 215–224.
STOC-2006-BeimelCNW #problem: Private approximation of search problems (AB, PC, KN, EW), pp. 119–128.
STOC-2006-DinurMR: Conditional hardness for approximate coloring (ID, EM, OR), pp. 344–353.
STOC-2006-Feldman #learning #logic #query: Hardness of approximate two-level logic minimization and PAC learning with membership queries (VF), pp. 363–372.
STOC-2006-KawarabayashiM #graph: Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs (KiK, BM), pp. 401–416.
STOC-2006-RemyS: A quasi-polynomial time approximation scheme for minimum weight triangulation (JR, AS), pp. 316–325.
TACAS-2006-KroeningS #image #logic: Approximating Predicate Images for Bit-Vector Logic (DK, NS), pp. 242–256.
LICS-2006-DawarGKS #first-order #optimisation #problem: Approximation Schemes for First-Order Definable Optimisation Problems (AD, MG, SK, NS), pp. 411–420.
LICS-2006-FischerMR #equivalence #satisfiability: Approximate Satisfiability and Equivalence (EF, FM, MdR), pp. 421–430.
ECDL-2005-AmatoD #database #xml: A Native XML Database Supporting Approximate Match Search (GA, FD), pp. 69–80.
PODS-2005-Dobra #question: Histograms revisited: when are histograms the best approximation method for aggregates over joins? (AD), pp. 228–237.
SIGMOD-2005-CormodeGMR #distributed: Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles (GC, MNG, SM, RR), pp. 25–36.
SIGMOD-2005-GovindarajuRM #mining #performance #using: Fast and Approximate Stream Mining of Quantiles and Frequencies Using Graphics Processors (NKG, NR, DM), pp. 611–622.
VLDB-2005-AugstenBG #using: Approximate Matching of Hierarchical Data Using pq-Grams (NA, MHB, JG), pp. 301–312.
VLDB-2005-CormodeG #distributed #query #sketching: Sketching Streams Through the Net: Distributed Approximate Query Tracking (GC, MNG), pp. 13–24.
VLDB-2005-JinKLT #retrieval: Indexing Mixed Types for Approximate Retrieval (LJ, NK, CL, AKHT), pp. 793–804.
VLDB-2005-KoudasS #concept: Approximate Joins: Concepts and Techniques (NK, DS), p. 1363.
CIAA-J-2004-Yli-Jyra05 #dependence #regular expression: Approximating dependency grammars through intersection of star-free regular languages (AYJ), pp. 565–579.
DLT-2005-BatuS #consistency #parsing #string: Locally Consistent Parsing and Applications to Approximate String Comparisons (TB, SCS), pp. 22–35.
DLT-2005-EpifanioGM: Languages with Mismatches and an Application to Approximate Indexing (CE, AG, FM), pp. 224–235.
ICALP-2005-ElbassioniFMS #algorithm: Approximation Algorithms for Euclidean Group TSP (KME, AVF, NHM, RS), pp. 1115–1126.
ICALP-2005-Farach-ColtonLST #performance #string: Optimal Spaced Seeds for Faster Approximate String Matching (MFC, GML, SCS, DT), pp. 1251–1262.
ICALP-2005-GairingMW #algorithm #combinator #parallel #performance #scheduling: A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines (MG, BM, AW), pp. 828–839.
ICALP-2005-Hast #linear #named #random: Approximating — Outperforming a Random Assignment with Almost a Linear Factor (GH), pp. 956–968.
ICALP-2005-Karakostas #problem: A Better Approximation Ratio for the Vertex Cover Problem (GK), pp. 1043–1050.
ICALP-2005-Nilsson: Approximate Guarding of Monotone and Rectilinear Polygons (BJN), pp. 1362–1373.
ICALP-2005-PemmarajuR #algorithm #problem: Approximation Algorithms for the Max-coloring Problem (SVP, RR), pp. 1064–1075.
ICALP-2005-RodittyTZ #distance: Deterministic Constructions of Approximate Distance Oracles and Spanners (LR, MT, UZ), pp. 261–272.
FM-2005-Gaudel #correctness #formal method #testing: Formal Methods and Testing: Hypotheses, and Correctness Approximations (MCG), pp. 2–8.
CIKM-2005-HsiehCY: Integrating DCT and DWT for approximating cube streams (MJH, MSC, PSY), pp. 179–186.
ICML-2005-DaumeM #learning #optimisation #predict #scalability: Learning as search optimization: approximate large margin methods for structured prediction (HDI, DM), pp. 169–176.
ICML-2005-IlghamiMNA #learning: Learning approximate preconditions for methods in hierarchical plans (OI, HMA, DSN, DWA), pp. 337–344.
ICML-2005-RamakrishnanCKB #classification: A model for handling approximate, noisy or incomplete labeling in text classification (GR, KPC, RK, PB), pp. 681–688.
ICML-2005-SnelsonG #predict: Compact approximations to Bayesian predictive distributions (ES, ZG), pp. 840–847.
SEKE-2005-HuangC #case study #distance: A Study of the Approximate Shortest Distance Route for the Construction Walk of Welding Robot (CJH, BKC), pp. 550–555.
POPL-2005-GrumbergLST #multi: Proof-guided underapproximation-widening for multi-process systems (OG, FL, OS, MT), pp. 122–131.
SAC-2005-BuenoTT #algorithm #query #search-based #similarity #using: Accelerating approximate similarity queries using genetic algorithms (RB, AJMT, CTJ), pp. 617–622.
SAC-2005-CanfieldX #documentation #xml: Approximate XML document matching (ERC, GX), pp. 787–788.
SAC-2005-HuangCC #algorithm #type inference: An approximation algorithm for haplotype inference by maximum parsimony (YTH, KMC, TC), pp. 146–150.
SAC-2005-SilvestriO #distributed #mining: Distributed approximate mining of frequent patterns (CS, SO), pp. 529–536.
DAC-2005-AminID #using: Piece-wise approximations of RLCK circuit responses using moment matching (CSA, YII, FD), pp. 927–932.
DAC-2005-LiuCO #design #multi: Approximate VCCs: a new characterization of multimedia workloads for system-level MpSoC design (YL, SC, WTO), pp. 248–253.
DATE-2005-WangM #modelling: EM Wave Coupling Noise Modeling Based on Chebyshev Approximation and Exact Moment Formulation (BW, PM), pp. 976–981.
DATE-2005-YangCK #algorithm #energy #multi #scheduling: An Approximation Algorithm for Energy-Efficient Scheduling on A Chip Multiprocessor (CYY, JJC, TWK), pp. 468–473.
STOC-2005-AgarwalCMM #algorithm #problem: O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems (AA, MC, KM, YM), pp. 573–581.
STOC-2005-BriestKV #design: Approximation techniques for utilitarian mechanism design (PB, PK, BV), pp. 39–48.
STOC-2005-ChenD #algorithm #fixpoint #on the: On algorithms for discrete and approximate brouwer fixed points (XC, XD), pp. 323–330.
STOC-2005-CheriyanV #algorithm #design #metric #network: Approximation algorithms for network design with metric costs (JC, AV), pp. 167–175.
STOC-2005-CryanDR #bound: Approximately counting integral flows and cell-bounded contingency tables (MC, MED, DR), pp. 413–422.
STOC-2005-DobzinskiNS #algorithm #combinator: Approximation algorithms for combinatorial auctions with complement-free bidders (SD, NN, MS), pp. 610–618.
STOC-2005-FeigeHL #algorithm: Improved approximation algorithms for minimum-weight vertex separators (UF, MTH, JRL), pp. 563–572.
STOC-2005-FlaxmanFV #algorithm #on the #performance #problem: On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem (AF, AMF, JCV), pp. 441–449.
STOC-2005-Garg #graph #problem: Saving an epsilon: a 2-approximation for the k-MST problem in graphs (NG), pp. 396–402.
STOC-2005-Hastad: Every 2-CSP allows nontrivial approximation (JH), pp. 740–746.
STOC-2005-IndykW #data type: Optimal approximations of the frequency moments of data streams (PI, DPW), pp. 202–208.
STOC-2005-JiaLNRS #set: Universal approximations for TSP, Steiner tree, and set cover (LJ, GL, GN, RR, RS), pp. 386–395.
STOC-2005-VegaKKV #composition #constraints #problem: Tensor decomposition and approximation schemes for constraint satisfaction problems (WFdlV, MK, RK, SV), pp. 747–754.
TACAS-2005-JeannetJRZ #analysis #testing: Symbolic Test Selection Based on Approximate Analysis (BJ, TJ, VR, EZ), pp. 349–364.
SAT-J-2004-Interian05 #algorithm #random: Approximation Algorithm for Random MAX- kSAT (YI), pp. 173–182.
CAV-2005-JhalaM: Interpolant-Based Transition Relation Approximation (RJ, KLM), pp. 39–51.
PODS-2004-ArasuM: Approximate Counts and Quantiles over Sliding Windows (AA, GSM), pp. 286–296.
SIGMOD-2004-DasGR: Approximation Techniques for Spatial Data (AD, JG, MR), pp. 695–706.
SIGMOD-2004-PolyzotisGI #query #xml: Approximate XML Query Answers (NP, MNG, YEI), pp. 263–274.
VLDB-2004-GuhaKMS: Merging the Results of Approximate Match Operations (SG, NK, AM, DS), pp. 636–647.
VLDB-2004-GuhaKS #named #streaming: XWAVE: Approximate Extended Wavelets for Streaming Data (SG, CK, KS), pp. 288–299.
VLDB-2004-KoudasOT0 #bound #fault #performance #query: Approximate NN queries on Streams with Guaranteed Error/performance Bounds (NK, BCO, KLT, RZ), pp. 804–815.
ITiCSE-2004-FisherLS: Curve and surface interpolation and approximation: knowledge unit and software tool (JF, JLL, CKS), pp. 146–150.
ITiCSE-WGR-2004-MatosG #dependence #functional: SQL-based discovery of exact and approximate functional dependencies (VM, BG), pp. 58–63.
CIAA-2004-DelgadoM #regular expression: Approximation to the Smallest Regular Expression for a Given Regular Language (MD, JM), pp. 312–314.
CIAA-2004-Yli-Jyra #dependence #regular expression: Approximating Dependency Grammars Through Intersection of Regular Languages (AYJ), pp. 281–292.
ICALP-2004-BjorklundHK: Approximating Longest Directed Paths and Cycles (AB, TH, SK), pp. 222–233.
ICALP-2004-CzumajS #clustering #random: Sublinear-Time Approximation for Clustering Via Random Sampling (AC, CS), pp. 396–407.
ICALP-2004-JothiR #algorithm #design #network #problem: Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design (RJ, BR), pp. 805–818.
ICALP-2004-Paluch #algorithm: A 2(1/8)-Approximation Algorithm for Rectangle Tiling (KEP), pp. 1054–1065.
RTA-2004-Blom #approach #λ-calculus: An Approximation Based Approach to Infinitary λ Calculi (SB), pp. 221–232.
ICEIS-v2-2004-CaleroDSSMS #database #dependence #experience #fuzzy: An Experience in Management of Imprecise Soil Databases by Means of Fuzzy Association Rules and Fuzzy Approximate Dependencies (JC, GD, MSM, DS, MAVM, JMS), pp. 138–146.
ICEIS-v2-2004-Kabiri #comparison #learning #network: A Comparison Between the Proportional Keen Approximator and the Neural Networks Learning Methods (PK), pp. 159–164.
CIKM-2004-ClarkeT #parallel: Approximating the top-m passages in a parallel question answering system (CLAC, ELT), pp. 454–462.
ICML-2004-MerkeS #convergence #learning #linear: Convergence of synchronous reinforcement learning with linear function approximation (AM, RS).
ICML-2004-TaoSVO #learning #multi: SVM-based generalized multiple-instance learning via approximate box counting (QT, SDS, NVV, TTO).
ICML-2004-WellingRT #markov: Approximate inference by Markov chains on union spaces (MW, MRZ, YWT).
ICML-2004-Ye #matrix #rank: Generalized low rank approximations of matrices (JY).
ICPR-v1-2004-BhowmickB #using: Approximate Fingerprint Matching Using Kd-Tree (PB, BBB), pp. 544–547.
ICPR-v1-2004-Debled-RennessonTW #performance: Fast Polygonal Approximation of Digital Curves (IDR, ST, LW), pp. 465–468.
ICPR-v1-2004-KangD #bound #classification #fault: Product Approximation by Minimizing the Upper Bound of Bayes Error Rate for Bayesian Combination of Classifiers (HJK, DSD), pp. 252–255.
ICPR-v2-2004-AltmuellerH #probability: Approximating High Dimensional Probability Distributions (SA, RMH), pp. 299–302.
ICPR-v2-2004-Ikeda #re-engineering #using: An Accurate Shape Reconstruction from Photometric Stereo Using Four Approximations of Surface Normal (OI), pp. 220–223.
ICPR-v2-2004-KolesnikovFW #multi: Multiresolution Polygonal Approximation of Digital Curves (AK, PF, XW), pp. 855–858.
ICPR-v2-2004-Srinivasan #segmentation: Small-world Approximations in Spectral Segmentation (SHS), pp. 36–39.
ICPR-v3-2004-FurukawaKMSMT #3d #estimation #image #physics #using: Spine Posture Estimation Method from Human Images Using 3D Spine Model — Computation of the rough approximation of the physical forces working on vertebral bodies (DF, TK, KM, YS, KM, TT), pp. 322–325.
ICPR-v4-2004-BoubchirFB #using: Bayesian Denoising in the Wavelet-Domain Using an Analytical Approximate a-Stable Prior (LB, MJF, DB), pp. 889–892.
ICPR-v4-2004-MizukamiWT #architecture #network: A Proposal of Neural Network Architecture for Non-Linear Function Approximation (YM, YW, KT), pp. 605–608.
KDD-2004-AfratiGM #set: Approximating a collection of frequent sets (FNA, AG, HM), pp. 12–19.
KDD-2004-BanerjeeDGMM #approach #clustering #matrix: A generalized maximum entropy approach to bregman co-clustering and matrix approximation (AB, ISD, JG, SM, DSM), pp. 509–514.
KR-2004-DohertySL #ontology #query: Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities (PD, AS, WL), pp. 459–468.
KR-2004-GrootTH #analysis #case study #classification #problem #towards: Towards a Structured Analysis of Approximate Problem Solving: A Case Study in Classification (PG, AtT, FvH), pp. 399–406.
SAS-2004-Colon #algebra #imperative #relational #semantics #source code: Approximating the Algebraic Relational Semantics of Imperative Programs (MC), pp. 296–311.
SAS-2004-Schmidt #logic: Closed and Logical Relations for Over- and Under-Approximation of Powersets (DAS), pp. 22–37.
ICSE-2004-Kang #analysis #embedded #parametricity #realtime: Parametric Analysis of Real-Time Embedded Systems with Abstract Approximation Interpretation (EYK), pp. 39–41.
SAC-2004-Logozzo #constraints #semantics: Approximating module semantics with constraints (FL), pp. 1490–1495.
CC-2004-OzerNG #probability #using: Stochastic Bit-Width Approximation Using Extreme Value Theory for Customizable Processors (EÖ, AN, DG), pp. 250–264.
DAC-2004-SalujaK #algorithm #robust: A robust algorithm for approximate compatible observability don’t care (CODC) computation (NS, SPK), pp. 422–427.
STOC-2004-AlonN #difference: Approximating the cut-norm via Grothendieck’s inequality (NA, AN), pp. 72–80.
STOC-2004-BansalBCM #algorithm: Approximation algorithms for deadline-TSP and vehicle routing with time-windows (NB, AB, SC, AM), pp. 166–174.
STOC-2004-ChuzhoyGHKKN #symmetry: Asymmetric k-center is log* n-hard to approximate (JC, SG, EH, SK, GK, JN), pp. 21–27.
STOC-2004-CorreaG #graph #theorem: An approximate König’s theorem for edge-coloring weighted bipartite graphs (JRC, MXG), pp. 398–406.
STOC-2004-Elkin #bound #distributed #problem #trade-off: Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (ME), pp. 331–340.
STOC-2004-GuptaPRS #algorithm #optimisation #probability: Boosted sampling: approximation algorithms for stochastic optimization (AG, MP, RR, AS), pp. 417–426.
STOC-2004-KortsarzN #algorithm #graph: Approximation algorithm for k-node connected subgraphs via critical graphs (GK, ZN), pp. 138–145.
STOC-2004-Obata #multi #theorem: Approximate max-integral-flow/min-multicut theorems (KO), pp. 539–545.
TACAS-2004-BallCDR #abstraction: Refining Approximations in Software Predicate Abstraction (TB, BC, SD, SKR), pp. 388–403.
SAT-2004-Interian #algorithm #random: Approximation Algorithm for Random MAX-kSAT (YI), pp. 64–68.
VMCAI-2004-HeraultLMP #model checking #probability: Approximate Probabilistic Model Checking (TH, RL, FM, SP), pp. 73–84.
SIGMOD-2003-Amer-YahiaFSX #named #xml: PIX: Exact and Approximate Phrase Matching in XML (SAY, MFF, DS, YX), p. 664.
SIGMOD-2003-BabcockCD #query: Dynamic Sample Selection for Approximate Query Processing (BB, SC, GD), pp. 539–550.
SIGMOD-2003-DasGR #data type: Approximate Join Processing Over Data Streams (AD, JG, MR), pp. 40–51.
VLDB-2003-Jermaine #estimation #robust: Robust Estimation With Sampling and Approximate Pre-Aggregation (CJ), pp. 886–897.
VLDB-2003-KoudasGGSV #constraints #optimisation #parametricity #performance #query: Efficient Approximation Of Optimization Queries Under Parametric Aggregation Constraints (SG, DG, NK, DS, MV), pp. 778–789.
IWPC-2003-CoxC #analysis #semiparsing #using: Syntactic Approximation Using Iterative Lexical Analysis (AC, CLAC), pp. 154–164.
ICALP-2003-AgeevYZ #algorithm #combinator #problem: Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem (AAA, YY, JZ), pp. 145–156.
ICALP-2003-AroraC #problem #strict: Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem (SA, KLC), pp. 176–188.
ICALP-2003-BespamyatnikhS #algorithm: Dynamic Algorithms for Approximating Interdistances (SB, MS), pp. 1169–1180.
ICALP-2003-Blaser #algorithm #difference #symmetry: An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality (MB), pp. 157–163.
ICALP-2003-ChekuriGN: Approximating Steiner k-Cuts (CC, SG, JN), pp. 189–199.
ICALP-2003-Coja-OghlanMS #graph #random: MAX k-CUT and Approximating the Chromatic Number of Random Graphs (ACO, CM, VS), pp. 200–211.
ICALP-2003-DeanG #algorithm #scheduling: Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling (BCD, MXG), pp. 1138–1152.
ICALP-2003-ElkinK #algorithm #multi #problem: Approximation Algorithm for Directed Telephone Multicast Problem (ME, GK), pp. 212–223.
ICALP-2003-GandhiHKKS #algorithm: An Improved Approximation Algorithm for Vertex Cover with Hard Capacities (RG, EH, SK, GK, AS), pp. 164–175.
CIKM-2003-BerraniAG #precise: Approximate searches: k-neighbors + precision (SAB, LA, PG), pp. 24–31.
CIKM-2003-OgrasF #reduction #using: Dimensionality reduction using magnitude and shape approximations (ÜYO, HF), pp. 99–107.
ICML-2003-DeCosteM #classification #incremental #kernel #performance: Fast Query-Optimized Kernel Machine Classification Via Incremental Approximate Nearest Support Vectors (DD, DM), pp. 115–122.
ICML-2003-Duff03a #markov: Diffusion Approximation for Bayesian Markov Chains (MOD), pp. 139–146.
ICML-2003-Munos #bound #fault #policy: Error Bounds for Approximate Policy Iteration (RM), pp. 560–567.
ICML-2003-SrebroJ #rank: Weighted Low-Rank Approximations (NS, TSJ), pp. 720–727.
ICML-2003-YanDMW #classification #optimisation #performance #statistics: Optimizing Classifier Performance via an Approximation to the Wilcoxon-Mann-Whitney Statistic (LY, RHD, MM, RHW), pp. 848–855.
ICML-2003-ZhangJYH #categorisation #scalability: Modified Logistic Regression: An Approximation to SVM and Its Applications in Large-Scale Text Categorization (JZ, RJ, YY, AGH), pp. 888–895.
MLDM-2003-MiteranBB #bound #classification #image #realtime #segmentation #using: Classification Boundary Approximation by Using Combination of Training Steps for Real-Time Image Segmentation (JM, SB, EBB), pp. 141–155.
LOPSTR-2003-BerghammerM #algorithm #development #using #verification: Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables (RB, MMO), pp. 59–74.
SAS-2003-KremenekE #named #static analysis #statistics #using: Z-Ranking: Using Statistical Analysis to Counter the Impact of Static Analysis Approximations (TK, DRE), pp. 295–315.
DATE-2003-CabodiNQ #bound #model checking #satisfiability #traversal: Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals (GC, SN, SQ), pp. 10898–10905.
DATE-2003-GouraryRUZGM #approach: Approximation Approach for Timing Jitter Characterization in Circuit Simulators (MMG, SGR, SLU, MMZ, KKG, BJM), pp. 10156–10161.
ESOP-2003-CastroW #logic programming: Approximate Pruning in Tabled Logic Programming (LFC, DSW), pp. 69–83.
FoSSaCS-2003-BreugelMOW #probability #similarity: An Intrinsic Characterization of Approximate Probabilistic Bisimilarity (FvB, MWM, JO, JW), pp. 200–215.
STOC-2003-Ajtai #algorithm #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-AmirKR #constant #graph: Constant factor approximation of vertex-cuts in planar graphs (EA, RK, SR), pp. 90–99.
STOC-2003-BatuEKMRRS #algorithm #distance #edit distance #sublinear: A sublinear algorithm for weakly approximating edit distance (TB, FE, JK, AM, SR, RR, RS), pp. 316–324.
STOC-2003-ChenRS #algorithm #confluence: Meet and merge: approximation algorithms for confluent flows (JC, RR, RS), pp. 373–382.
STOC-2003-Dyer #programming: Approximate counting by dynamic programming (MED), pp. 693–699.
STOC-2003-FakcharoenpholRT #bound #metric: A tight bound on approximating arbitrary metrics by tree metrics (JF, SR, KT), pp. 448–455.
STOC-2003-GuptaKR #algorithm #design #network: Simpler and better approximation algorithms for network design (AG, AK, TR), pp. 365–372.
STOC-2003-KonemannR #bound: Primal-dual meets local search: approximating MST’s with nonuniform degree bounds (JK, RR), pp. 389–395.
STOC-2003-Plaxton #algorithm #problem: Approximation algorithms for hierarchical location problems (CGP), pp. 40–49.
STOC-2003-VegaKKR #clustering #problem: Approximation schemes for clustering problems (WFdlV, MK, CK, YR), pp. 50–58.
LICS-2003-DanosD #markov #performance #process: Labelled Markov Processes: Stronger and Faster Approximations (VD, JD), pp. 341–350.
PODS-2002-ChatterjiEGY #complexity #on the #optimisation #query: On the Complexity of Approximate Query Optimization (SC, SSKE, SG, MDY), pp. 282–292.
SIGMOD-2002-GuhaJKSY #xml: Approximate XML joins (SG, HVJ, NK, DS, TY), pp. 287–298.
VLDB-2002-LiuJ #named: A-TOPSS — A Publish/Subscribe System Supporting Approximate Matching (HL, HAJ), pp. 1107–1110.
VLDB-2002-MankuM #data type: Approximate Frequency Counts over Data Streams (GSM, RM), pp. 346–357.
ICSM-2002-RedondoAVB #retrieval #reuse #specification: Approximate Retrieval of Incomplete and Formal Specifications Applied to Vertical Reuse (RPDR, JJPA, AFV, ABBM), pp. 618–627.
CIAA-J-2000-BergeronH02 #algorithm #string: Vector Algorithms for Approximate String Matching (AB, SH), pp. 53–66.
ICALP-2002-BermanK #bound: Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION (PB, MK), pp. 623–632.
ICALP-2002-BermanKN #parallel: Approximating Huffman Codes in Parallel (PB, MK, YN), pp. 845–855.
ICALP-2002-CzumajLZ #design #network #polynomial #problem: Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem (AC, AL, HZ), pp. 973–984.
ICALP-2002-HermenegildoPBL #debugging #semantics #specification #using #validation: Program Debugging and Validation Using Semantic Approximations and Partial Specifications (MVH, GP, FB, PLG), pp. 69–72.
ICALP-2002-Nisan #communication #complexity #set: The Communication Complexity of Approximate Set Packing and Covering (NN), pp. 868–875.
ICGT-2002-BaldanK #behaviour #graph transformation: Approximating the Behaviour of Graph Transformation Systems (PB, BK), pp. 14–29.
CIKM-2002-GrahneZ #xml: Discovering approximate keys in XML data (GG, JZ), pp. 453–460.
ICML-2002-FitzgibbonDA #monte carlo #polynomial: Univariate Polynomial Inference by Monte Carlo Message Length Approximation (LJF, DLD, LA), pp. 147–154.
ICML-2002-KakadeL #learning: Approximately Optimal Approximate Reinforcement Learning (SK, JL), pp. 267–274.
ICML-2002-MerkeS #convergence #learning: A Necessary Condition of Convergence for Reinforcement Learning with Function Approximation (AM, RS), pp. 411–418.
ICPR-v1-2002-YuK #3d #estimation: An Approximative Calculation of Relative Convex Hulls for Surface Area Estimation of 3D Digital Objects (LY, RK), pp. 131–134.
ICPR-v2-2002-Robles-KellySH #performance #segmentation: A Fast Leading Eigenvector Approximation for Segmentation and Grouping (ARK, SS, ERH), pp. 639–642.
ICPR-v2-2002-YangBS #recognition: An Application of Nonlinear Wavelet Approximation to Face Recognition (LY, TDB, CYS), p. 48–?.
ICPR-v4-2002-KolesnikovF #algorithm #performance: A Fast Near-Optimal Algorithm for Approximation of Polygonal Curves (AK, PF), pp. 335–338.
ICPR-v4-2002-MollinedaVC #approach #string: A Windowed Weighted Approach for Approximate Cyclic String Matching (RAM, EV, FC), pp. 188–191.
KR-2002-BrandtKT #difference #logic: Approximation and Difference in Description Logics (SB, RK, AYT), pp. 203–214.
KR-2002-DeneckerMT #information management #representation: Ultimate Approximations in Nonmonotonic Knowledge Representation Systems (MD, VWM, MT), pp. 177–190.
SAS-2002-Jeannet #abstract interpretation #data type #representation: Representing and Approximating Transfer Functions in Abstract Interpretation of Hetereogeneous Datatypes (BJ), pp. 52–68.
SAS-2002-PierroHW: Analysing Approximate Confinement under Uniform Attacks (ADP, CH, HW), pp. 310–325.
DATE-2002-CoelhoSP #algorithm #using: Passive Constrained Rational Approximation Algorithm Using Nevanlinna-Pick Interpolation (CPC, LMS, JRP), pp. 923–930.
STOC-2002-AjtaiJKS #data type: Approximate counting of inversions in a data stream (MA, TSJ, RK, DS), pp. 370–379.
STOC-2002-AlonVKK #problem #random: Random sampling and approximation of MAX-CSP problems (NA, WFdlV, RK, MK), pp. 232–239.
STOC-2002-AryaMM #diagrams: Space-efficient approximate Voronoi diagrams (SA, TM, DMM), pp. 721–730.
STOC-2002-BadoiuHI #clustering: Approximate clustering via core-sets (MB, SHP, PI), pp. 250–257.
STOC-2002-BatuDKR #complexity: The complexity of approximating entropy (TB, SD, RK, RR), pp. 678–687.
STOC-2002-CharikarLLPPRSS #complexity #modelling: Approximating the smallest grammar: Kolmogorov complexity in natural models (MC, EL, DL, RP, MP, AR, AS, AS), pp. 792–801.
STOC-2002-ChekuriK: Approximation schemes for preemptive weighted flow time (CC, SK), pp. 297–305.
STOC-2002-CheriyanVV #algorithm #low cost: Approximation algorithms for minimum-cost k-vertex connected subgraphs (JC, SV, AV), pp. 306–312.
STOC-2002-ChienRS #algebra: Clifford algebras and approximating the permanent (SC, LER, AS), pp. 222–231.
STOC-2002-CryanD #algorithm #constant #polynomial: A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (MC, MED), pp. 240–249.
STOC-2002-ElkinK #algorithm #combinator #problem: Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem (ME, GK), pp. 438–447.
STOC-2002-Feige #complexity: Relations between average case complexity and approximation complexity (UF), pp. 534–543.
STOC-2002-GilbertGIKMS #algorithm #maintenance #performance: Fast, small-space algorithms for approximate histogram maintenance (ACG, SG, PI, YK, SM, MS), pp. 389–398.
STOC-2002-Holmerin: Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon (JH), pp. 544–552.
STOC-2002-Khot: Hardness results for approximate hypergraph coloring (SK), pp. 351–359.
STOC-2002-SaksS #bound #data type #distance: Space lower bounds for distance approximation in the data stream model (MES, XS), pp. 360–369.
CAV-2002-BarnerG #model checking #reduction #symmetry: Combining Symmetry Reduction and Under-Approximation for Symbolic Model Checking (SB, OG), pp. 93–106.
ICLP-2002-FerrandL #finite #logic programming #reduction: A Logic Program Characterization of Domain Reduction Approximations in Finite Domain CSPs (GF, AL), pp. 478–479.
VMCAI-2002-HardingRS #atl: Approximating ATL* in ATL (AH, MR, PYS), pp. 289–301.
ICDAR-2001-MikheevVF: High-Quality Polygonal Contour Approximation Based on Relaxation (AM, LV, VF), pp. 361–367.
ICDAR-2001-Takasu #documentation #performance #string: Document Filtering for Fast Approximate String Matching of Errorneous Text (AT), pp. 916–920.
JCDL-2001-AbdullaBCKLMTLS #ad hoc #query #simulation: Approximate ad-hoc query engine for simulation data (GA, CB, TC, RK, IL, RM, NAT, BSL, RRS), pp. 255–256.
PODS-2001-GilbertKMS #statistics #summary: Optimal and Approximate Computation of Summary Statistics for Range Aggregates (ACG, YK, SM, MS).
VLDB-2001-GarofalakisG #query: Approximate Query Processing: Taming the TeraBytes (MNG, PBG).
VLDB-2001-GilbertKMS #query #summary: Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries (ACG, YK, SM, MS), pp. 79–88.
VLDB-2001-GravanoIJKMS #database #for free #string: Approximate String Joins in a Database (Almost) for Free (LG, PGI, HVJ, NK, SM, DS), pp. 491–500.
ICALP-2001-ChazelleRT #sublinear: Approximating the Minimum Spanning Tree Weight in Sublinear Time (BC, RR, LT), pp. 190–200.
ICALP-2001-EngebretsenK #bound #metric: Approximation Hardness of TSP with Bounded Metrics (LE, MK), pp. 201–212.
ICALP-2001-FeigenbaumIMNSW #multi: Secure Multiparty Computation of Approximations (JF, YI, TM, KN, MS, RNW), pp. 927–938.
ICALP-2001-GandhiKS #algorithm #problem: Approximation Algorithms for Partial Covering Problems (RG, SK, AS), pp. 225–236.
CIKM-2001-FerroRG: Approximately Common Patterns in Shared-Forests (MVF, FJR, JGG), pp. 73–80.
ICML-2001-ChoiR #difference #fixpoint #learning #performance: A Generalized Kalman Filter for Fixed Point Approximation and Efficient Temporal Difference Learning (DC, BVR), pp. 43–50.
ICML-2001-DomeniconiG #approach #classification #dataset #multi #nearest neighbour #performance #query #scalability: An Efficient Approach for Approximating Multi-dimensional Range Queries and Nearest Neighbor Classification in Large Datasets (CD, DG), pp. 98–105.
ICML-2001-PrecupSD #difference #learning: Off-Policy Temporal Difference Learning with Function Approximation (DP, RSS, SD), pp. 417–424.
ICML-2001-Zhang #bound #problem: Some Sparse Approximation Bounds for Regression Problems (TZ0), pp. 624–631.
PPDP-2001-GiavittoM #data type #declarative: Declarative Definition of Group Indexed Data Structures and Approximation of Their Domains (JLG, OM), pp. 150–161.
SAC-2001-BaroneBVM #algorithm #analysis #problem: An approximation algorithm for the shortest common supersequence problem: an experimental analysis (PB, PB, GDV, GM), pp. 56–60.
PDP-2001-BeaumontBLRR #algorithm #clustering #multi: Heterogeneous Matrix-Matrix Multiplication or Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms (OB, VB, AL, FR, YR), pp. 298–305.
STOC-2001-BartalCR #clustering #metric: Approximating min-sum k-clustering in metric spaces (YB, MC, DR), pp. 11–20.
STOC-2001-GoemansW #algorithm #problem #programming: Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (MXG, DPW), pp. 443–452.
STOC-2001-GuhaMM #constant #problem: A constant factor approximation for the single sink edge installation problems (SG, AM, KM), pp. 383–388.
STOC-2001-HaleviKKN #np-hard: Private approximation of NP-hard functions (SH, RK, EK, KN), pp. 550–559.
STOC-2001-JainV #algorithm #game studies: Applications of approximation algorithms to cooperative games (KJ, VVV), pp. 364–372.
STOC-2001-JerrumSV #algorithm #matrix #polynomial: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries (MJ, AS, EV), pp. 712–721.
STOC-2001-MossR #algorithm #problem: Approximation algorithms for constrained for constrained node weighted steiner tree problems (AM, YR), pp. 373–382.
STOC-2001-Shparlinski #finite #polynomial: Sparse polynomial approximation in finite fields (IS), pp. 209–215.
STOC-2001-ThorupZ #distance: Approximate distance oracles (MT, UZ), pp. 183–192.
CSL-2001-Koriche #first-order #logic #reasoning: A Logic for Approximate First-Order Reasoning (FK), pp. 262–276.
ICLP-2001-Colmerauer #constraints #multi: Solving the Multiplication Constraint in Several Approximation Spaces (AC), p. 1.
IJCAR-2001-Middeldorp #automaton #dependence #graph #using: Approximating Dependency Graphs Using Tree Automata Techniques (AM), pp. 593–610.
LICS-2001-DasD: Successive Approximation of Abstract Transition Relations (SD, DLD), pp. 51–58.
PODS-2000-GeertsK #database #linear #logic #transitive #using: Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic (FG, BK), pp. 126–135.
SIGMOD-2000-AcharyaGP #query: Congressional Samples for Approximate Answering of Group-By Queries (SA, PBG, VP), pp. 487–498.
SIGMOD-2000-GunopulosKTD #multi #query: Approximating Multi-Dimensional Aggregate Range Queries over Real Attributes (DG, GK, VJT, CD), pp. 463–474.
SIGMOD-2000-WangSSZZW #database: An Approximate Search Engine for Structural Databases (JTLW, XW, DS, BAS, KZ, XZ, QM, ZW), p. 584.
VLDB-2000-Bar-YossefBCFW #query #random #web: Approximating Aggregate Queries about Web Pages via Random Walks (ZBY, ACB, SC, JF, DW), pp. 535–544.
VLDB-2000-ChakrabartiGRS #query #using: Approximate Query Processing Using Wavelets (KC, MNG, RR, KS), pp. 111–122.
VLDB-2000-ChangG #query: Approximate Query Translation Across Heterogeneous Information Sources (KCCC, HGM), pp. 566–577.
VLDB-2000-GantiLR #named #query #self: ICICLES: Self-Tuning Samples for Approximate Query Answering (VG, MLL, RR), pp. 176–187.
VLDB-2000-SakuraiYUK #using: The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation (YS, MY, SU, HK), pp. 516–526.
ICALP-2000-CzumajL #multi #performance #problem: Fast Approximation Schemes for Euclidean Multi-connectivity Problems (AC, AL), pp. 856–868.
ICALP-2000-EngebretsenH #clique: Clique Is Hard to Approximate within n1-o(1) (LE, JH), pp. 2–12.
ICALP-2000-Grigni #graph: Approximate TSP in Graphs with Forbidden Minors (MG), pp. 869–877.
ICALP-2000-Hastad #algorithm #np-hard #optimisation #performance #problem #question: Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? (JH), p. 235.
ICALP-2000-JansenP #multi #scheduling: Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling (KJ, LP), pp. 878–889.
ICALP-2000-KrivelevichV #independence: Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time (MK, VHV), pp. 13–24.
CIKM-2000-EgeciogluF #reduction #similarity: Dimensionality Reduction and Similarity Computation by Inner Product Approximations (ÖE, HF), pp. 219–226.
CIKM-2000-FerhatosmanogluTAA #set: Vector Approximation based Indexing for Non-uniform High Dimensional Data Sets (HF, ET, DA, AEA), pp. 202–209.
CIKM-2000-WangW #nearest neighbour: Supporting Subseries Nearest Neighbor Search via Approximation (CW, XSW), pp. 314–321.
CIKM-2000-WuAA #composition #query #using: Using Wavelet Decomposition to Support Progressive and Approximate Range-Sum Queries over Data Cubes (YLW, DA, AEA), pp. 414–421.
ICML-2000-FariasR #fixpoint #learning: Fixed Points of Approximate Value Iteration and Temporal-Difference Learning (DPdF, BVR), pp. 207–214.
ICML-2000-JiangL #information retrieval: Approximate Dimension Equalization in Vector-based Information Retrieval (FJ, MLL), pp. 423–430.
ICML-2000-SmolaS #machine learning #matrix: Sparse Greedy Matrix Approximation for Machine Learning (AJS, BS), pp. 911–918.
ICPR-v2-2000-Figueiredo #learning #on the: On Gaussian Radial Basis Function Approximations: Interpretation, Extensions, and Learning Strategies (MATF), pp. 2618–2621.
ICPR-v2-2000-HontaniD #generative #multi: Primitive Curve Generation Based on Multiscale Contour Figure Approximation (HH, KD), pp. 2887–2890.
ICPR-v2-2000-SunOKAKT #algorithm #distance #reduction: Two-Stage Computational Cost Reduction Algorithm Based on Mahalanobis Distance Approximations (FS, SO, NK, HA, SK, TT), pp. 2696–2699.
ICPR-v3-2000-TongW #image #nearest neighbour: Approximate Nearest Neighbor Search for Fractal Image Compression Based on a New Affine Transform Parametrization (CT, MW), pp. 3223–3227.
ICPR-v3-2000-TraverRI #algorithm #performance #search-based: Exploring the Performance of Genetic Algorithms as Polygonal Approximators (VJT, GR, JMIQ), pp. 3774–3777.
KDD-2000-FeldmanLRSS #bias #framework #information management #specification: A framework for specifying explicit bias for revision of approximate information extraction rules (RF, YL, BR, YS, JS), pp. 189–197.
KR-2000-McCarthy: Approximate Objects and Approximate Theories (JM0), pp. 519–526.
KR-2000-VerberneHT #constraints #reasoning #using: Anytime Diagnostic Reasoning using Approximate Boolean Constraint Propagation (AV, FvH, AtT), pp. 323–332.
PEPM-2000-GallagherP #using: Using Regular Approximations for Generalisation During Partial Evalution (JPG, JCP), pp. 44–51.
ICSE-2000-DangK #infinity #model checking #realtime: Three approximation techniques for ASTRAL symbolic model checking of infinite state real-time systems (ZD, RAK), pp. 345–354.
DAC-2000-ChenK #linear #programming: Floorplan sizing by linear programming approximation (PC, ESK), pp. 468–471.
LCTES-2000-CortiBG #execution #multi #worst-case: Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems (MC, RB, TRG), pp. 178–198.
STOC-2000-AleksandrovMS #algorithm #geometry #problem: Approximation algorithms for geometric shortest path problems (LA, AM, JRS), pp. 286–295.
STOC-2000-Bar-NoyBFNS #approach #resource management #scheduling: A unified approach to approximating resource allocation and scheduling (ABN, RBY, AF, JN, BS), pp. 735–744.
STOC-2000-EvenGS #graph: Improved approximations of crossings in graph drawings (GE, SG, BS), pp. 296–305.
STOC-2000-FeigeHK: Approximating the domatic number (UF, MMH, GK), pp. 134–143.
STOC-2000-FeigeKN: Approximating the minimum bisection size (UF, RK, KN), pp. 530–536.
STOC-2000-Furer #matrix: Approximating permanents of complex matrices (MF), pp. 667–669.
STOC-2000-GuptaT #algorithm #classification #constant #problem: A constant factor approximation algorithm for a class of classification problems (AG, ÉT), pp. 652–658.
STOC-2000-GurvitsS #algorithm #polynomial: A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume (LG, AS), pp. 48–57.
STOC-2000-KenyonSY #polynomial: Polynomial-time approximation scheme for data broadcast (CK, NS, NEY), pp. 659–666.
STOC-2000-KonemannR #algorithm #bound #matter: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees (JK, RR), pp. 537–546.
STOC-2000-MuthukrishnanS #comparison #nearest neighbour #sequence: Approximate nearest neighbors and sequence comparison with block operations (SM, SCS), pp. 416–424.
LICS-2000-DesharnaisGJP #markov #process: Approximating Labeled Markov Processes (JD, VG, RJ, PP), pp. 95–106.
LICS-2000-LemstromH #logic #pattern matching #transitive: Approximate Pattern Matching is Expressible in Transitive Closure Logic (KL, LH), pp. 157–167.
ICDAR-1999-ChaSS #algorithm #analysis #recognition #sequence #string: Approximate Stroke Sequence String Matching Algorithm for Character Recognition and Analysis (SHC, YCS, SNS), pp. 53–56.
PODS-1999-BenediktL #constraints #query: Exact and Approximate Aggregation in Constraint Query (MB, LL), pp. 102–113.
SIGMOD-1999-AcharyaGPR #query: The Aqua Approximate Query Answering System (SA, PBG, VP, SR), pp. 574–576.
SIGMOD-1999-AcharyaGPR99a #query: Join Synopses for Approximate Query Answering (SA, PBG, VP, SR), pp. 275–286.
SIGMOD-1999-VitterW #multi #using: Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets (JSV, MW), pp. 193–204.
VLDB-1999-AcharyaGP #named #performance #query #using: Aqua: A Fast Decision Support Systems Using Approximate Query Answers (SA, PBG, VP), pp. 754–757.
VLDB-1999-IoannidisP: Histogram-Based Approximation of Set-Valued Query-Answers (YEI, VP), pp. 174–185.
IWPC-1999-HarmanFHBD #decidability: Program Simplification as a Means of Approximating Undecidable Propositions (MH, CF, RMH, DB, SD), pp. 208–217.
ICALP-1999-HammarN: Approximation Results for Kinetic Variants of TSP (MH, BJN), pp. 392–401.
ICALP-1999-KrauseSW #problem: Approximations by OBDDs and the Variable Ordering Problem (MK, PS, IW), pp. 493–502.
FLOPS-1999-BeierleM #prolog #source code #type checking #using: Using Types as Approximations for Type Checking Prolog Programs (CB, GM), pp. 251–266.
HCI-CCAD-1999-YuCK #multi #using: Dynamic event filtering technique using multi-level path approximation in a shared virtual environment (SJY, YCC, KK), pp. 583–587.
ICML-1999-UtgoffS #unification: Approximation Via Value Unification (PEU, DJS), pp. 425–432.
KDD-1999-BarbaraW #data analysis #using: Using Approximations to Scale Exploratory Data Analysis in Datacubes (DB, XW), pp. 382–386.
KDD-1999-BennettFG #nearest neighbour #query: Density-Based Indexing for Approximate Nearest-Neighbor Queries (KPB, UMF, DG), pp. 233–243.
KDD-1999-ShanmugasundaramFB #query: Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions (JS, UMF, PSB), pp. 223–232.
SAC-1999-Bugarin #linear #polynomial: Linear Quadratic Approximation for Solving a Model Economy Distorted by Progressive Taxation (MNSB), pp. 52–56.
DAC-1999-BeniniMMOP #algorithm #component #kernel #optimisation: Kernel-Based Power Optimization of RTL Components: Exact and Approximate Extraction Algorithms (LB, GDM, EM, GO, MP), pp. 247–252.
DAC-1999-ChenW #bound #fault: Error Bounded Padé Approximation via Bilinear Conformal Transformation (CPC, DFW), pp. 7–12.
DAC-1999-CoelhoPS #algorithm #generative #robust: Robust Rational Function Approximation Algorithm for Model Generation (CPC, JRP, LMS), pp. 207–212.
DAC-1999-GovindarajuDB #reachability #using: Improved Approximate Reachability Using Auxiliary State Variables (SGG, DLD, JPB), pp. 312–316.
DATE-1999-CornoRS #algorithm #equivalence #search-based #verification: Approximate Equivalence Verification of Sequential Circuits via Genetic Algorithms (FC, MSR, GS), pp. 754–755.
STOC-1999-AroraK #latency #problem: Approximation Schemes for Minimum Latency Problems (SA, GK), pp. 688–693.
STOC-1999-Bar-NoyGNS #multi #realtime #scheduling #throughput: Approximating the Throughput of Multiple Machines Under Real-Time Scheduling (ABN, SG, JN, BS), pp. 622–631.
STOC-1999-BorodinOR99a #algorithm #clustering #problem: Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces (AB, RO, YR), pp. 435–444.
STOC-1999-ChakrabartiCGL #bound #complexity #nearest neighbour: A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube (AC, BC, BG, AL), pp. 305–311.
STOC-1999-CharikarGTS #algorithm #problem: A Constant-Factor Approximation Algorithm for the k-Median Problem (MC, SG, ÉT, DBS), pp. 1–10.
STOC-1999-ChenM #multi #polynomial #scheduling: A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling (JC, AM), pp. 418–427.
STOC-1999-ErgunKR #performance: Fast Approximate PCPs (FE, RK, RR), pp. 41–50.
STOC-1999-GuruswamiKRSY #algorithm #problem: Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems (VG, SK, RR, FBS, MY), pp. 19–28.
STOC-1999-JansenP #parallel #scheduling: Improved Approximation Schemes for Scheduling Unrelated Parallel Machines (KJ, LP), pp. 408–417.
STOC-1999-JansenSS #polynomial: Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme (KJ, RSO, MS), pp. 394–399.
STOC-1999-KiwiMS #fault #testing: Approximate Testing with Relative Error (MAK, FM, MS), pp. 51–60.
STOC-1999-NayakW #complexity #quantum #query #statistics: The Quantum Query Complexity of Approximating the Median and Related Statistics (AN, FW), pp. 384–393.
STOC-1999-SchulmanV #problem: Majorizing Estimators and the Approximation of #P-Complete Problems (LJS, VVV), pp. 288–294.
SIGMOD-1998-GibbonsM #query #statistics #summary: New Sampling-Based Summary Statistics for Improving Approximate Query Answers (PBG, YM), pp. 331–342.
SIGMOD-1998-RajagopalanML #memory management: Approximate Medians and other Quantiles in One Pass and with Limited Memory (GSM, SR, BGL), pp. 426–435.
VLDB-1998-AnkerstBKS #adaptation #query #similarity #using: Improving Adaptable Similarity Query Processing by Using Approximations (MA, BB, HPK, TS), pp. 206–217.
VLDB-1998-ShivakumarGC: Filtering with Approximate Predicates (NS, HGM, CC), pp. 263–274.
VLDB-1998-ZimbraoS: A Raster Approximation For Processing of Spatial Joins (GZ, JMdS), pp. 558–569.
ICALP-1998-BazganST #algorithm #performance #problem #similarity: Efficient Approximation Algorithms for the Subset-Sums Equality Problem (CB, MS, ZT), pp. 387–396.
ICALP-1998-CzumajL #polynomial: A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity (AC, AL), pp. 682–694.
ICALP-1998-PelegR #communication: Deterministic Polylog Approximation for Minimum Communication Spanning Trees (DP, ER), pp. 670–681.
WIA-1998-HolubM #automaton #finite #implementation #nondeterminism #pattern matching: Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching (JH, BM), pp. 92–99.
RTA-1998-Genet #decidability #normalisation #set: Decidable Approximations of Sets of Descendants and Sets of Normal Forms (TG), pp. 151–165.
CIKM-1998-ThomasianCL #clustering #composition: Clustering and Singular Value Decomposition for Approximate Indexing in High Dimensional Spaces (AT, VC, CSL), pp. 201–207.
CIKM-1998-VitterWI: Data Cube Approximation and Histograms via Wavelets (JSV, MW, BRI), pp. 96–104.
ICML-1998-KollerF #learning #probability #process #using: Using Learning for Approximation in Stochastic Processes (DK, RF), pp. 287–295.
ICML-1998-PrecupU #classification #using: Classification Using Phi-Machines and Constructive Function Approximation (DP, PEU), pp. 439–444.
ICPR-1998-JuanVA #algorithm #nearest neighbour #performance: Fast k-nearest-neighbours searching through extended versions of the approximating and eliminating search algorithm (AESA) (AJ, EV, PA), pp. 828–830.
ICPR-1998-KahlH #re-engineering #robust #self: Robust self-calibration and Euclidean reconstruction via affine approximation (FK, AH), pp. 56–58.
ICPR-1998-PalauS #classification #nearest neighbour #performance: The labelled cell classifier: a fast approximation to k nearest neighbors (AMP, RRS), pp. 823–827.
SAC-1998-WaldenBH #clustering #fuzzy #multi #using: Evaluating multi-valued inverse functions using clustering and fuzzy approximations (MAW, MB, AH), pp. 74–79.
DAC-1998-GovindarajuDHH #reachability #using: Approximate Reachability with BDDs Using Overlapping Projections (SGG, DLD, AJH, MH), pp. 451–456.
DAC-1998-RaviMSS #composition #diagrams: Approximation and Decomposition of Binary Decision Diagrams (KR, KLM, TRS, FS), pp. 445–450.
DATE-1998-FreundF #linear #modelling #multi #scalability #using: Reduced-Order Modeling of Large Linear Passive Multi-Terminal Circuits Using Matrix-Pade Approximation (RWF, PF), pp. 530–537.
DATE-1998-HelvigRZ #bound #problem: Improved Approximation Bounds for the Group Steiner Problem (CSH, GR, AZ), pp. 406–413.
DATE-1998-JiangC #estimation: Exact and Approximate Estimation for Maximum Instantaneous Current of CMOS Circuits (YMJ, KTC), pp. 698–702.
DATE-1998-ShaoC #design #using: MCM Interconnect Design Using Two-Pole Approximation (JS, RMMC), pp. 544–548.
STOC-1998-AroraRR #problem: Approximation Schemes for Euclidean k-Medians and Related Problems (SA, PR, SR), pp. 106–113.
STOC-1998-Bartal #metric #on the: On Approximating Arbitrary Metrices by Tree Metrics (YB), pp. 161–168.
STOC-1998-CalinescuKR #algorithm #multi: An Improved Approximation Algorithm for Multiway Cut (GC, HJK, YR), pp. 48–52.
STOC-1998-CharikarCGG #algorithm: Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median (MC, CC, AG, SG), pp. 114–123.
STOC-1998-Feige: Approximating the Bandwidth via Volume Respecting Embeddings (UF), pp. 90–99.
STOC-1998-Huber: Exact Sampling and Approximate Counting Techniques (MH), pp. 31–40.
STOC-1998-IndykM #nearest neighbour #towards: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality (PI, RM), pp. 604–613.
STOC-1998-KushilevitzOR #nearest neighbour #performance: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces (EK, RO, YR), pp. 614–623.
STOC-1998-LinialSW #algorithm #matrix #polynomial #scalability: A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents (NL, AS, AW), pp. 644–652.
STOC-1998-NatanzonSS #algorithm #polynomial #problem: A Polynomial Approximation Algorithm for the Minimum Fill-In Problem (AN, RS, RS), pp. 41–47.
STOC-1998-RaoS #geometry #graph: Approximating Geometrical Graphs via “Spanners” and “Banyans” (SR, WDS), pp. 540–550.
ICDAR-1997-Favata #recognition #string #using #word: General word recognition using approximate segment-string matching (JTF), pp. 92–96.
ICDAR-1997-HarukiH #image #scalability: Scalable Image Coding by Spline Approximation for a Gray-scale Image (RH, TH), pp. 407–411.
ICDAR-1997-Takasu #string: An Approximate String Match for Garbled Text with Various Accuracy (AT), pp. 957–961.
VLDB-1997-GibbonsMP #incremental #maintenance #performance: Fast Incremental Maintenance of Approximate Histograms (PBG, YM, VP), pp. 466–475.
ICALP-1997-Fujito #approach #problem: A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties (TF), pp. 749–759.
ICALP-1997-Jansen #problem: Approximation Results for the Optimum Cost Partition Problem (KJ), pp. 727–737.
CIKM-1997-Baeza-YatesN #retrieval: Block Addressing Indices for Approximate Text Retrieval (RABY, GN), pp. 1–8.
CIKM-1997-FrenchPS #information retrieval #word: Applications of Approximate Word Matching in Information Retrieval (JCF, ALP, ES), pp. 9–15.
ICML-1997-Baxter #canonical: The Canonical Distortion Measure for Vector Quantization and Function Approximation (JB), pp. 39–47.
ICML-1997-KimuraMK #learning: Reinforcement Learning in POMDPs with Function Approximation (HK, KM, SK), pp. 152–160.
SIGIR-1997-Cooper #how: How to Read Less and Know More — Approximate OCR for Thai (DC), pp. 216–225.
LOPSTR-1997-SaglamG #logic programming #source code: Constrained Regular Approximation of Logic Programs (HS, JPG), pp. 282–299.
SAS-1997-Marriott #abstract interpretation #formal method: Abstract Interpretation: A Theory of Approximate Computation (KM), pp. 367–378.
SAC-1997-HashemiCTSP #multi: A diagnostic system based on a multi-decision approximate rules model (RRH, FFC, JRT, WS, MGP), pp. 20–24.
STOC-1997-AsanoKTT #polynomial #towards: Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k (TA, NK, HT, TT), pp. 275–283.
STOC-1997-AuerLS #learning #pseudo #set: Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets (PA, PML, AS), pp. 314–323.
STOC-1997-DuhF #optimisation: Approximation of k-Set Cover by Semi-Local Optimization (RcD, MF), pp. 256–264.
STOC-1997-LeonardiR #parallel: Approximating Total Flow Time on Parallel Machines (SL, DR), pp. 110–119.
STOC-1997-LubyV: Approximately Counting Up To Four (ML, EV), pp. 682–687.
STOC-1997-Reif #constant #evaluation #polynomial: Approximate Complex Polynomial Evaluation in Near Constant Work Per Point (JHR), pp. 30–39.
STOC-1997-ShmoysTA #algorithm #problem: Approximation Algorithms for Facility Location Problems (DBS, ÉT, KA), pp. 265–274.
STOC-1997-SrinivasanT #algorithm: A Constant-Factor Approximation Algorithm for Packet Routing, and Balancing Local vs. Global Criteria (AS, CPT), pp. 636–643.
ILPS-1997-BaralS #reasoning: Approximate Reasoning about Actions in Presence of Sensing and Incomplete Information (CB, TCS), pp. 387–401.
ICALP-1996-AlonS #integer #parallel #problem #programming: Improved Parallel Approximation of a Class of Integer Programming Programming Problems (NA, AS), pp. 562–573.
ICALP-1996-Chen #graph #problem: Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs (ZZC), pp. 268–279.
RTA-1996-Jacquemard #decidability #term rewriting: Decidable Approximations of Term Rewriting Systems (FJ), pp. 362–376.
ICML-1996-BoutilierD #programming: Approximate Value Trees in Structured Dynamic Programming (CB, RD), pp. 54–62.
ICML-1996-TadepalliO #domain model #learning #modelling #scalability: Scaling Up Average Reward Reinforcement Learning by Approximating the Domain Models and the Value Function (PT, DO), pp. 471–479.
ICPR-1996-FischlS #adaptation #image: Learned adaptive nonlinear filtering for anisotropic diffusion approximation in image processing (BF, ELS), pp. 276–280.
ICPR-1996-Matalas #image #multi #set: A new set of multiscale texture features based on B-spline image approximation (IM), pp. 810–814.
ICPR-1996-TakasuKYIOA: Approximate matching for OCR-processed bibliographic data (AT, NK, MY, OI, KO, JA), pp. 175–179.
ICPR-1996-YuCXY #3d #higher-order: 3D shape and motion by SVD under higher-order approximation of perspective projection (HY, QC, GX, MY), pp. 456–460.
KR-1996-TeijeH #using: Computing Approximate Diagnoses By Using Approximate Entailment (AtT, FvH), pp. 256–265.
DAC-1996-ChenH #algorithm #performance: Efficient Approximation Algorithms for Floorplan Area Minimization (DZC, XH), pp. 483–486.
DAC-1996-TutuianuDP: An Explicit RC-Circuit Delay Approximation Based on the First Three Moments of the Impulse Response (BT, FD, LTP), pp. 611–616.
STOC-1996-AlonMS #complexity: The Space Complexity of Approximating the Frequency Moments (NA, YM, MS), pp. 20–29.
STOC-1996-BenczurK: Approximating s-t Minimum Cuts in Õ(n2) Time (AAB, DRK), pp. 47–55.
STOC-1996-BlumRV #algorithm #problem: A Constant-factor Approximation Algorithm for the k MST Problem (AB, RR, SV), pp. 442–448.
STOC-1996-Feige #set: A Threshold of ln n for Approximating Set Cover (UF), pp. 314–318.
STOC-1996-KleinL #algorithm #performance #source code: Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING (PNK, HIL), pp. 338–347.
CSL-1996-Malmstrom #optimisation #problem: Optimization Problems with Approximation Schemes (AM), pp. 316–333.
ICDAR-v2-1995-AbuhaibaDH95a #documentation: Processing of text documents: straight line approximation and lost loop recovery (ISIA, SD, MJJH), pp. 1157–1160.
ICALP-1995-Ambos-Spies #on the #polynomial: On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (KAS), pp. 384–392.
ICALP-1995-Henzinger: Approximating Minimum Cuts under Insertions (MRH), pp. 280–291.
ICML-1995-Baird #algorithm #learning: Residual Algorithms: Reinforcement Learning with Function Approximation (LCBI), pp. 30–37.
ICML-1995-Gordon #programming: Stable Function Approximation in Dynamic Programming (GJG), pp. 261–268.
KDD-1995-DeogunRS #set: Exploiting Upper Approximation in the Rough Set Methodology (JSD, VVR, HS), pp. 69–74.
PLILP-1995-SaglamG #constraints #logic programming #polymorphism #source code #using: Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions (HS, JPG), pp. 461–462.
SAC-1995-HoeltingSW #problem: Approximation techniques for variations of the p-median problem (CJH, DAS, RLW), pp. 293–299.
STOC-1995-AroraKK #np-hard #polynomial #problem: Polynomial time approximation schemes for dense instances of NP-hard problems (SA, DRK, MK), pp. 284–293.
STOC-1995-AwerbuchABV: Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen (BA, YA, AB, SV), pp. 277–283.
STOC-1995-BlumCV #problem: A constant-factor approximation for the k-MST problem in the plane (AB, PC, SV), pp. 294–302.
STOC-1995-Karger #network #polynomial #problem #random #reliability: A randomized fully polynomial time approximation scheme for the all terminal network reliability problem (DRK), pp. 11–17.
STOC-1995-KhullerR #algorithm #problem: Improved approximation algorithms for uniform connectivity problems (SK, BR), pp. 1–10.
STOC-1995-KleinbergT #network #problem: Approximations for the disjoint paths problem in high-diameter planar networks (JMK, ÉT), pp. 26–35.
STOC-1995-Pan #algorithm #parallel #polynomial: Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros (VYP), pp. 741–750.
STOC-1995-Srinivasan #problem: Improved approximations of packing and covering problems (AS), pp. 268–276.
TACAS-1995-FrancescoFGI #finite #model checking #process: Model Checking of Non-Finite State Processes by Finite Approximations (NDF, AF, SG, PI), pp. 195–215.
TACAS-1995-Tofts #probability #process: Analytic and Locally Approximate Solutions to Properties of Probabilistic Processes (CMNT), pp. 174–194.
CAV-1995-DillW #realtime #verification: Verification of Real-Time Systems by Successive Over and Under Approximation (DLD, HWT), pp. 409–422.
PODS-1994-ChaudhuriK #datalog #question: Can Datalog be Approximated? (SC, PGK), pp. 86–96.
ICALP-1994-JiangL #on the #sequence: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences (TJ, ML), pp. 191–202.
SIGIR-1994-RobertsonW #effectiveness #probability #retrieval: Some Simple Effective Approximations to the 2-Poisson Model for Probabilistic Weighted Retrieval (SER, SW), pp. 232–241.
ALP-1994-CodishM #algebra #proving: Proving Implications by Algebraic Approximation (MC, GM), pp. 6–22.
SAS-1994-HalbwachsPR #hybrid #linear #verification: Verification of Linear Hybrid Systems by Means of Convex Approximations (NH, YEP, PR), pp. 223–237.
SAC-1994-RunklerG #fuzzy #named #performance #realtime: DECADE — fast centroid approximation defuzzification for real time fuzzy control applications (TAR, MG), pp. 161–165.
DAC-1994-TsuiPD: Exact and Approximate Methods for Calculating Signal and Transition Probabilities in FSMs (CYT, MP, AMD), pp. 18–23.
EDAC-1994-ChoHMPS #algorithm #automaton #composition #traversal: A State Space Decomposition Algorithm for Approximate FSM Traversal (HC, GDH, EM, MP, FS), pp. 137–141.
EDAC-1994-WangD #linear #optimisation #performance #using: An Efficient Yield Optimization Method Using A Two Step Linear Approximation of Circuit Performance (ZW, SWD), pp. 567–571.
ESOP-J-1992-HankinH94 #abstract interpretation #fixpoint: Approximate Fixed Points in Abstract Interpretation (CH, SH), pp. 283–306.
STOC-1994-AwerbuchL #algorithm #multi #network #problem: Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks (BA, TL), pp. 487–496.
STOC-1994-BellareGLR #performance #probability #proving: Efficient probabilistic checkable proofs and applications to approximation (MB, SG, CL, AR), p. 820.
STOC-1994-ChariRS #algorithm #probability: Improved algorithms via approximations of probability distributions (SC, PR, AS), pp. 584–592.
STOC-1994-Cohen: Polylog-time and near-linear work approximation scheme for undirected shortest paths (EC), pp. 16–26.
STOC-1994-GargH #algorithm #problem: An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane (NG, DSH), pp. 432–438.
STOC-1994-GoemansW #algorithm #satisfiability: .879-approximation algorithms for MAX CUT and MAX 2SAT (MXG, DPW), pp. 422–431.
STOC-1994-HalldorssonR #bound #graph #independence #set: Greed is good: approximating independent sets in sparse and bounded-degree graphs (MMH, JR), pp. 439–448.
STOC-1994-JiangLW #complexity #sequence: Aligning sequences via an evolutionary tree: complexity and approximation (TJ, ELL, LW), pp. 760–769.
STOC-1994-MaratheHSR #problem #specification: Approximation schemes for PSPACE-complete problems for succinct specifications (MVM, HBHI, RES, VR), pp. 468–477.
ICLP-1994-GallagherW #logic programming #performance #precise #source code: Fast and Precise Regular Approximations of Logic Programs (JPG, DAdW), pp. 599–613.
ILPS-1994-MarriottS #constraints #interactive #linear: Approximating Interaction between Linear Arithmetic Constraints (KM, PJS), pp. 571–585.
LICS-1994-HuthJK #linear: Linear Types, Approximation, and Topology (MH, AJ, KK), pp. 110–114.
ICDAR-1993-YangHT #automation #identification #using: Automatic seal identification using fluency function approximation and relaxation matching method (YY, TH, KT), pp. 786–789.
ICALP-1993-GargVY #algorithm #multi #set: Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover (NG, VVV, MY), pp. 64–75.
ICALP-1993-Kann #bound #problem: Polynomially Bounded Minimization Problems which are Hard to Approximate (VK), pp. 52–63.
ICALP-1993-LundY #problem: The Approximation of Maximum Subgraph Problems (CL, MY), pp. 40–51.
ICALP-1993-MaratheHR #complexity #problem #specification: The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (MVM, HBHI, SSR), pp. 76–87.
ICML-1993-Ellman #abstraction #clustering #constraints #synthesis: Synthesis of Abstraction Hierarchies for Constraint Satisfaction by Clustering Approximately Equivalent Objects (TE), pp. 104–111.
PLILP-1993-AlpuenteFRV #equation #logic programming #optimisation #source code: Narrowing Approximations as an Optimization for Equational Logic Programs (MA, MF, MJR, GV), pp. 391–409.
DAC-1993-ChoHMPS #algorithm #automaton #traversal: Algorithms for Approximate FSM Traversal (HC, GDH, EM, BP, FS), pp. 25–30.
DAC-1993-HuangPS #approach #heuristic #polynomial #problem: A Polynomial-Time Heuristic Approach to Approximate a Solution to the False Path Problem (STH, TMP, JMS), pp. 118–122.
DAC-1993-SriramK #performance: Fast Approximation of the Transient Response of Lossy Transmision Line Trees (MS, SMK), pp. 691–696.
STOC-1993-AielloAMR #network: Approximate load balancing on dynamic and asynchronous networks (WA, BA, BMM, SR), pp. 632–641.
STOC-1993-ArBCG: Checking approximate computations over the reals (SA, MB, BC, PG), pp. 786–795.
STOC-1993-BellareGLR #performance #proving: Efficient probabilistically checkable proofs and applications to approximations (MB, SG, CL, AR), pp. 294–304.
STOC-1993-CondonFLS #algorithm: Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (AC, JF, CL, PWS), pp. 305–314.
STOC-1993-GargVY #multi #theorem: Approximate max-flow min-(multi)cut theorems and their applications (NG, VVV, MY), pp. 698–707.
STOC-1993-LubyN #algorithm #linear #parallel #programming: A parallel approximation algorithm for positive linear programming (ML, NN), pp. 448–457.
STOC-1993-LundY #on the #problem: On the hardness of approximating minimization problems (CL, MY), pp. 286–293.
STOC-1993-RaviMRRH #algorithm #multi: Many birds with one stone: multi-objective approximation algorithms (RR, MVM, SSR, DJR, HBHI), pp. 438–447.
STOC-1993-WilliamsonGMV #algorithm #network #problem: A primal-dual approximation algorithm for generalized Steiner network problems (DPW, MXG, MM, VVV), pp. 708–717.
ILPS-1993-BaralGK #logic programming #source code: Approximating General Logic Programs (CB, MG, OK), pp. 181–198.
ICALP-1992-KhullerT #algorithm #graph: Approximation Algorithms for Graph Augmentation (SK, RT), pp. 330–341.
ICALP-1992-Mansour #random: Randomized Interpolation and Approximation of Sparse Polynomials (YM), pp. 261–272.
CIKM-1992-KeenR #database #dependence #induction: Inductive Dependencies and Approximate Databases (DK, AR), pp. 98–114.
KR-1992-CadoliS #concept: Approximation in Concept Description Languages (MC, MS), pp. 330–341.
KR-1992-GreinerS #learning: Learning Useful Horn Approximations (RG, DS), pp. 383–392.
KR-1992-KollerH #logic #reasoning: A Logic for Approximate Reasoning (DK, JYH), pp. 153–164.
PLDI-1992-LandiR #algorithm #alias #interprocedural #pointer: A Safe Approximate Algorithm for Interprocedural Pointer Aliasing (WL, BGR), pp. 235–248.
WSA-1992-Serpette #french: Approximations d’évaluateurs fonctionnels (BPS), pp. 79–90.
Best-of-PLDI-1992-LandiR92a #algorithm #alias #interprocedural #pointer: A safe approximate algorithm for interprocedural pointer aliasing (with retrospective) (WL, BGR), pp. 473–489.
DAC-1992-AnastasakisGKP #evaluation #on the: On the Stability of Moment-Matching Approximations in Asymptotic Waveform Evaluation (DFA, NG, SYK, LTP), pp. 207–212.
ESOP-1992-HankinH #abstract interpretation #fixpoint: Approximate Fixed Points in Abstract Interpretation (CH, SH), pp. 219–232.
STOC-1992-EvenGLNV #independence: Approximations of General Independent Distributions (GE, OG, ML, NN, BV), pp. 10–16.
STOC-1992-KhullerV #graph: Biconnectivity Approximations and Graph Carvings (SK, UV), pp. 759–770.
STOC-1992-KleinS #parallel #random: A Parallel Randomized Approximation Scheme for Shortest Paths (PNK, SS), pp. 750–758.
STOC-1992-LinV #constraints: epsilon-Approximations with Minimum Packing Constraint Violation (JHL, JSV), pp. 771–782.
STOC-1992-Paturi #on the #symmetry: On the Degree of Polynomials that Approximate Symmetric Boolean Functions (RP), pp. 468–474.
STOC-1992-Reed: Finding Approximate Separators and Computing Tree Width Quickly (BAR), pp. 221–228.
CAV-1992-AlurIKY #verification: Timing Verification by Successive Approximation (RA, AI, RPK, MY), pp. 137–150.
CSL-1992-BehrendtCG #optimisation #problem: Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions (TB, KJC, EG), pp. 43–60.
ICALP-1991-RaviAK #graph #problem #scheduling: Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion (RR, AA, PNK), pp. 751–762.
KR-1991-GreinerO: Probably Approximately Optimal Derivation Strategies (RG, PO), pp. 277–288.
ML-1991-Berenji #learning #refinement: Refinement of Approximate Reasoning-based Controllers by Reinforcement Learning (HRB), pp. 475–479.
ML-1991-FeldmanSK #incremental #refinement: Incremental Refinement of Approximate Domain Theories (RF, AMS, MK), pp. 500–504.
ML-1991-KedarBD #refinement: The Blind Leading the Blind: Mutual Refinement of Approximate Theories (SK, JLB, CLD), pp. 308–312.
DAC-1991-CardenC #algorithm #multi #performance #using: A Global Router Using An Efficient Approximate Multicommodity Multiterminal Flow Algorithm (RCCI, CKC), pp. 316–321.
CAAP-1991-LuccioP #problem: Simple Solutions for Approximate Tree Matching Problems (FL, LP), pp. 193–201.
STOC-1991-AgrawalKR #algorithm #network #problem: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks (AA, PNK, RR), pp. 134–144.
STOC-1991-BlumJLTY #linear #string: Linear Approximation of Shortest Superstrings (AB, TJ, ML, JT, MY), pp. 328–336.
STOC-1991-GemmellLRSW #self: Self-Testing/Correcting for Polynomials and for Approximate Functions (PG, RJL, RR, MS, AW), pp. 32–42.
STOC-1991-LeightonMPSTT #algorithm #multi #performance #problem: Fast Approximation Algorithms for Multicommodity Flow Problems (FTL, FM, SAP, CS, ÉT, ST), pp. 101–111.
STOC-1991-LubyV #on the: On Deterministic Approximation of DNF (ML, BV), pp. 430–438.
STOC-1991-Matousek #divide and conquer #geometry: Approximations and Optimal Geometric Divide-And-Conquer (JM), pp. 505–511.
ICALP-1990-AltBW: Approximation of Convex Polygons (HA, JB, HW), pp. 703–716.
ICALP-1990-JerrumS #algorithm #polynomial: Polynomial-Time Approximation Algorithms for Ising Model (MJ, AS), pp. 462–475.
ML-1990-Bennett: Reducing Real-world Failures of Approximate Explanation-based Rules (SWB), pp. 226–234.
ML-1990-Cohen90a #learning: Learning Approximate Control Rules of High Utility (WWC), pp. 268–276.
ML-1990-Sutton #architecture #learning #programming: Integrated Architectures for Learning, Planning, and Reacting Based on Approximating Dynamic Programming (RSS), pp. 216–224.
PLILP-1990-Nilsson #logic programming #semantics #source code: Systematic Semantic Approximations of Logic Programs (UN), pp. 293–306.
POPL-1990-HeintzeJ #finite #logic programming #source code #theorem: A Finite Presentation Theorem for Approximating Logic Programs (NH, JJ), pp. 197–209.
STOC-1990-KleinST #algorithm #concurrent #performance: Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities (PNK, CS, ÉT), pp. 310–321.
STOC-1990-LinialN: Approximate Inclusion-Exclusion (NL, NN), pp. 260–270.
STOC-1990-PanconesiR #quantifier: Quantifiers and Approximation (AP, DR), pp. 446–456.
ICALP-1989-GalilP #algorithm #string: An Improved Algorithm for Approximate String Matching (ZG, KP), pp. 394–404.
ML-1989-ChaseZPBMH: Approximating Learned Search Control Knowledge (MPC, MZ, RLP, JDB, PPM, HH), pp. 218–220.
ML-1989-Tadepalli: Planning Approximate Plans for Use in the Real World (PT), pp. 224–228.
STOC-1989-Blum #algorithm: An O(n⁰⋅⁴)-Approximation Algorithm for 3-Coloring (and Improved Approximation Algorithm for k-Coloring) (AB), pp. 535–542.
STOC-1989-DyerFK #algorithm #polynomial #random: A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies (MED, AMF, RK), pp. 375–381.
STOC-1989-PittW #automaton #consistency #polynomial #problem: The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial (LP, MKW), pp. 421–432.
STOC-1989-Razborov #on the: On the Method of Approximations (AAR), pp. 167–176.
NACLP-1989-JacobsL #alias #logic programming #performance #source code: Accurate and Efficient Approximation of Variable Aliasing in Logic Programs (DJ, AL), pp. 154–165.
PODS-1988-BunemanDW #query #semantics: A Semantics for Complex Objects and Approximate Queries (PB, SBD, AW), pp. 305–314.
ICALP-1988-CoriM #automaton #distributed: Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System (RC, YM), pp. 147–161.
STOC-1988-Broder #how #random: Errata to “How hard is to marry at random? (On the approximation of the permanent)” (AZB), p. 551.
STOC-1988-FederG #algorithm #clustering: Optimal Algorithms for Approximate Clustering (TF, DHG), pp. 434–444.
STOC-1988-JerrumS #agile #markov: Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (MJ, AS), pp. 235–244.
STOC-1988-PapadimitriouY88a #complexity #optimisation: Optimization, Approximation, and Complexity Classes (CHP, MY), pp. 229–234.
CADE-1988-SubrahmanianU #consistency #named #reasoning: QUANTLOG: A System for Approximate Reasoning in Inconsistent Formal Systems (VSS, ZDU), pp. 746–747.
ICALP-1987-PazS #integer: Approximating Integer Lattices by Lattices with Cyclic Factor Groups (AP, CPS), pp. 386–393.
SIGIR-1987-Kwok #query: Some Considerations for Approximate Optimal Queries (KLK), pp. 19–23.
STOC-1987-Clarkson #algorithm: Approximation Algorithms for Shortest Path Motion Planning (KLC), pp. 56–65.
STOC-1987-GoldbergT #low cost #problem: Solving Minimum-Cost Flow Problems by Successive Approximation (AVG, RET), pp. 7–18.
CSL-1987-Rasiowa #logic #reasoning: Logic of Approximation Reasoning (HR), pp. 188–210.
STOC-1986-Broder #how #random: How hard is to marry at random? (On the approximation of the permanent) (AZB), pp. 50–58.
STOC-1986-LandauV #algorithm #parallel #performance #string: Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm (GML, UV), pp. 220–230.
STOC-1984-Clarkson #algorithm #geometry #performance: Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (KLC), pp. 342–348.
STOC-1984-HochbaumS #graph #problem: Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems (DSH, DBS), pp. 324–333.
PODS-1983-MurthyKK #algorithm #network #problem: An Approximation Algorithm to the File Allocation Problem in Computer Networks (KM, JBK, MSK), pp. 258–266.
STOC-1983-BakerBL #algorithm: An Approximation Algorithm for Manhattan Routing (BSB, SNB, FTL), pp. 477–486.
STOC-1983-Stockmeyer #complexity: The Complexity of Approximate Counting (LJS), pp. 118–126.
SIGMOD-1982-DongH #dependence #order: Applying Approximate Order Dependency to Reduce Indexing Space (JD, RH), pp. 119–127.
ICALP-1982-ComynD: Approximations of Infinitary Objects (GC, MD), pp. 116–127.
STOC-1982-Bar-YehudaE #graph #on the: On Approximating a Vertex Cover for Planar Graphs (RBY, SE), pp. 303–309.
STOC-1982-Wigderson #algorithm #graph: A New Approximate Graph Coloring Algorithm (AW), pp. 325–329.
SIGMOD-1980-LamY #algorithm #distributed #problem: An Approximation Algorithm for a File-Allocation Problem in a Hierarchical Distributed System (KL, CTY), pp. 125–132.
ICALP-1980-Bini #rank: Border Rank of a p×q×2 Tensor and the Optimal Approximation of a Pair of Bilinear Forms (DB), pp. 98–108.
DAC-1978-Fortin #diagrams #named #using: BUBBLE: Relationship diagrams using iterative vector approximation (GF), pp. 145–151.
STOC-1978-CarterFGMW: Exact and Approximate Membership Testers (LC, RWF, JG, GM, MNW), pp. 59–65.
ICALP-1977-PazM #nondeterminism #optimisation #polynomial #problem: Non-Deterministic Polynomial Optimization Problems and Their Approximation (AP, SM), pp. 370–379.
POPL-1977-CousotC #abstract interpretation #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.
DAC-1976-Daae #interactive: Bandpass filter approximation by interactive graphics (HD), pp. 131–133.
STOC-1973-Johnson #algorithm #combinator #problem: Approximation Algorithms for Combinatorial Problems (DSJ), pp. 38–49.
ICALP-1972-Bertoni #complexity #probability #problem: Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines (AB), pp. 507–516.
ICALP-1972-PazR #automaton #linear #problem: Linear Automata — Approximation Problem (AP, MR), pp. 99–102.
ICALP-1972-Reghizzi #set: Approximation of Phrase Markers by Regular Sets (SCR), pp. 367–376.