BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
likelihood (27)
algorithm (27)
entropi (26)
use (26)
estim (25)

Stem maximum$ (all stems)

196 papers:

DACDAC-2015-LiuZ #configuration management #performance
A reconfigurable analog substrate for highly efficient maximum flow computation (GL, ZZ), p. 6.
SIGMODSIGMOD-2015-ChangLQYZ #algorithm #component
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity (LC, XL, LQ, JXY, WZ), pp. 459–474.
SIGMODSIGMOD-2015-VerroiosLG #crowdsourcing #named
tDP: An Optimal-Latency Budget Allocation Strategy for Crowdsourced MAXIMUM Operations (VV, PL, HGM), pp. 1047–1062.
VLDBVLDB-2015-LiuLYXW #graph #independence #set #towards
Towards Maximum Independent Sets on Massive Graphs (YL, JL, HY, XX, ZW), pp. 2122–2133.
VLDBVLDB-2015-MouratidisZP #query #rank
Maximum Rank Query (KM, JZ, HP), pp. 1554–1565.
ICALPICALP-v1-2015-GawrychowskiMW #matrix #query
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (PG, SM, OW), pp. 580–592.
LATALATA-2015-DaiW #algorithm #parallel #random #sequence
A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk (HKD, ZW), pp. 133–144.
CHICHI-2015-CarterH #design #research
Designing Autism Research for Maximum Impact (EJC, JH), pp. 2801–2804.
KDDKDD-2015-LeeWK #consistency #constraints #difference #privacy
Maximum Likelihood Postprocessing for Differential Privacy under Consistency Constraints (JL, YW, DK), pp. 635–644.
SIGIRSIGIR-2015-Paik #information retrieval #probability
A Probabilistic Model for Information Retrieval Based on Maximum Value Distribution (JHP), pp. 585–594.
DATEDATE-2014-YuSHEAB #estimation #performance #physics
Efficient performance estimation with very small sample size via physical subspace projection and maximum a posteriori estimation (LY, SS, CH, IME, DAA, DSB), pp. 1–6.
DocEngDocEng-2014-Fan0N #using
Paper stitching using maximum tolerant seam under local distortions (WF, JS, SN), pp. 35–44.
DLTDLT-2014-KociumakaRRW #standard #word
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word (TK, JR, WR, TW), pp. 215–226.
ICALPICALP-v1-2014-ColeK #algorithm #performance #summary
Fast Algorithms for Constructing Maximum Entropy Summary Trees (RC, HJK), pp. 332–343.
ICALPICALP-v1-2014-GawrychowskiMW #matrix #query
Improved Submatrix Maximum Queries in Monge Matrices (PG, SM, OW), pp. 525–537.
ICMLICML-c1-2014-IyerNS #bound #convergence #estimation #kernel
Maximum Mean Discrepancy for Class Ratio Estimation: Convergence Bounds and Kernel Selection (AI, SN, SS), pp. 530–538.
ICMLICML-c1-2014-OrabonaHSJ #on the #random
On Measure Concentration of Random Maximum A-Posteriori Perturbations (FO, TH, ADS, TSJ), pp. 432–440.
ICMLICML-c2-2014-HuangCG #estimation #scalability
Scalable Semidefinite Relaxation for Maximum A Posterior Estimation (QXH, YC, LJG), pp. 64–72.
ICMLICML-c2-2014-KontorovichW #multi #nearest neighbour
Maximum Margin Multiclass Nearest Neighbors (AK, RW), pp. 892–900.
ICPRICPR-2014-BrownFP #detection #self #using
Temporal Non-maximum Suppression for Pedestrian Detection Using Self-Calibration (LMGB, RSF, SP), pp. 2239–2244.
ICPRICPR-2014-LuZXGW #approximate #morphism #quantum
Approximate Maximum Common Sub-graph Isomorphism Based on Discrete-Time Quantum Walk (KL, YZ, KX, YG, RCW), pp. 1413–1418.
ICPRICPR-2014-NguyenTHM #classification #novel
A Novel Sphere-Based Maximum Margin Classification Method (PN, DT, XH, WM), pp. 620–624.
ISSTAISSTA-2014-GotliebM #named #network #reduction #testing
FLOWER: optimal test suite reduction as a network maximum flow (AG, DM), pp. 171–180.
ISSTAISSTA-2014-LinK #automation #concurrent #multi #satisfiability #source code #thread #using
Automatic repair for multi-threaded programs with Deadlock/Livelock using maximum satisfiability (YL, SSK), pp. 237–247.
ICSTSAT-2014-IgnatievMM #independence #on the #satisfiability #set
On Reducing Maximum Independent Set to Minimum Satisfiability (AI, AM, JMS), pp. 103–120.
STOCSTOC-2013-LeeRS #approach #using
A new approach to computing maximum flows using electrical flows (YTL, SR, NS), pp. 755–764.
ICALPICALP-v1-2013-0002BFGK
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines (SA, KB, TF, NG, AK), pp. 13–24.
ICALPICALP-v1-2013-ChekuriNS #graph
Maximum Edge-Disjoint Paths in k-Sums of Graphs (CC, GN, FBS), pp. 328–339.
ICALPICALP-v1-2013-SviridenkoW #problem #scalability #set
Large Neighborhood Local Search for the Maximum Set Packing Problem (MS, JW), pp. 792–803.
ICMLICML-c1-2013-ChenWC
Maximum Variance Correction with Application to A* Search (WC, KQW, YC), pp. 302–310.
ICMLICML-c3-2013-Chatzis #infinity
Infinite Markov-Switching Maximum Entropy Discrimination Machines (SC), pp. 729–737.
ICMLICML-c3-2013-CortesMR #classification #kernel #multi
Multi-Class Classification with Maximum Margin Multiple Kernel (CC, MM, AR), pp. 46–54.
ICMLICML-c3-2013-PeharzTP #generative #network
The Most Generative Maximum Margin Bayesian Networks (RP, ST, FP), pp. 235–243.
RecSysRecSys-2013-HammarKN #e-commerce #recommendation #using
Using maximum coverage to optimize recommendation systems in e-commerce (MH, RK, BJN), pp. 265–272.
LICSLICS-2013-AndersonDH #fixpoint #linear #logic #programming
Maximum Matching and Linear Programming in Fixed-Point Logic with Counting (MA, AD, BH), pp. 173–182.
ICSTSAT-2013-IgnatievJM #approach #quantifier #satisfiability
Quantified Maximum Satisfiability: — A Core-Guided Approach (AI, MJ, JMS), pp. 250–266.
FLOPSFLOPS-2012-Morihata #algorithm #parallel #problem
Calculational Developments of New Parallel Algorithms for Size-Constrained Maximum-Sum Segment Problems (AM), pp. 213–227.
CIKMCIKM-2012-FanZCCO #clustering
Maximum margin clustering on evolutionary data (XF, LZ, LC, XC, YSO), pp. 625–634.
ICMLICML-2012-DefazioC #collaboration #performance #visual notation
A Graphical Model Formulation of Collaborative Filtering Neighbourhood Methods with Fast Maximum Entropy Training (AD, TSC), p. 75.
ICMLICML-2012-HazanJ #on the #random
On the Partition Function and Random Maximum A-Posteriori Perturbations (TH, TSJ), p. 217.
ICMLICML-2012-PeharzP #learning #network
Exact Maximum Margin Structure Learning of Bayesian Networks (RP, FP), p. 102.
ICMLICML-2012-ZhangS
Maximum Margin Output Coding (YZ, JGS), p. 53.
ICPRICPR-2012-XuanSCS #algorithm #using
An Enhanced EM algorithm using maximum entropy distribution as initial condition (GX, YQS, PC, PS), pp. 849–852.
KDDKDD-2012-HiraiY #clustering #detection #normalisation #using
Detecting changes of clustering structures using normalized maximum likelihood coding (SH, KY), pp. 343–351.
KDDKDD-2012-RamG #using
Maximum inner-product search using cone trees (PR, AGG), pp. 931–939.
MLDMMLDM-2012-XuCG #concept #learning #multi #using
Constructing Target Concept in Multiple Instance Learning Using Maximum Partial Entropy (TX, DKYC, IG), pp. 169–182.
SACSAC-2012-IkemotoDO #pseudo #reliability
Estimating software reliability via pseudo maximum likelihood method (SI, TD, HO), pp. 1171–1176.
SACSAC-2012-SeelandBKP
Maximum Common Subgraph based locally weighted regression (MS, FB, SK, BP), pp. 165–172.
DACDAC-2011-Li #memory management
Rethinking memory redundancy: optimal bit cell repair for maximum-information storage (XL0), pp. 316–321.
DATEDATE-2011-HuangQ #constraints #energy #realtime
Leakage aware energy minimization for real-time systems under the maximum temperature constraint (HH, GQ), pp. 479–484.
PLDIPLDI-2011-JoseM #fault #locality #satisfiability #using
Cause clue clauses: error localization using maximum satisfiability (MJ, RM), pp. 437–446.
STOCSTOC-2011-BravermanR #communication #fault #interactive #towards
Towards coding for maximum errors in interactive communication (MB, AR), pp. 159–166.
STOCSTOC-2011-ChristianoKMST #approximate #graph #performance
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs (PC, JAK, AM, DAS, SHT), pp. 273–282.
ICALPICALP-v2-2011-AhnG #linear #problem #programming
Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem (KJA, SG), pp. 526–538.
MLDMMLDM-2011-YokotaY #classification #estimation
Quadratically Constrained Maximum a Posteriori Estimation for Binary Classifier (TY, YY), pp. 1–15.
SACSAC-2011-KatayamaKKM #algorithm #clique #problem
Memetic algorithm with strategic controller for the maximum clique problem (KK, AK, KK, HM), pp. 1062–1069.
PPoPPPPoPP-2011-HongKOO #algorithm #graph
Accelerating CUDA graph algorithms at maximum warp (SH, SKK, TO, KO), pp. 267–276.
SIGMODSIGMOD-2010-TaoSL #graph
Finding maximum degrees in hidden bipartite graphs (YT, CS, JL), pp. 891–902.
STOCSTOC-2010-Hirai #bound #multi #problem
The maximum multiflow problems with bounded fractionality (HH), pp. 115–120.
ICALPICALP-v1-2010-BonichonGHP
Plane Spanners of Maximum Degree Six (NB, CG, NH, LP), pp. 19–30.
ICALPICALP-v1-2010-MakarychevMS #algorithm #approximate #polynomial #problem #reduction
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm (KM, RM, MS), pp. 594–604.
CIKMCIKM-2010-FanWW #clustering #normalisation #performance #visual notation
Maximum normalized spacing for efficient visual clustering (ZGF, YW, BW), pp. 409–418.
ECIRECIR-2010-AgarwalC #algorithm #information retrieval #ranking
Maximum Margin Ranking Algorithms for Information Retrieval (SA, MC), pp. 332–343.
ICMLICML-2010-YangJJ #learning
Learning from Noisy Side Information by Generalized Maximum Entropy Model (TY, RJ, AKJ), pp. 1199–1206.
ICMLICML-2010-ZiebartBD #interactive #modelling #principle
Modeling Interaction via the Principle of Maximum Causal Entropy (BDZ, JAB, AKD), pp. 1255–1262.
ICPRICPR-2010-AriA #estimation #modelling #optimisation #using
Maximum Likelihood Estimation of Gaussian Mixture Models Using Particle Swarm Optimization (CA, SA), pp. 746–749.
ICPRICPR-2010-DukkipatiYM #classification #feature model #modelling
Maximum Entropy Model Based Classification with Feature Selection (AD, AKY, MNM), pp. 565–568.
ICDARICDAR-2009-DoA #recognition
Maximum Margin Training of Gaussian HMMs for Handwriting Recognition (TMTD, TA), pp. 976–980.
STOCSTOC-2009-YoshidaYI #algorithm #approximate
An improved constant-time approximation algorithm for maximum~matchings (YY, MY, HI), pp. 225–234.
ICALPICALP-v1-2009-AgnarssonHL #algorithm #independence #problem #set
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs (GA, MMH, EL), pp. 12–23.
ICALPICALP-v2-2009-AzarMMPS #adaptation #network
Maximum Bipartite Flow in Networks with Adaptive Channel Width (YA, AM, TM, DP, AS), pp. 351–362.
CIKMCIKM-2009-GuZ #clustering
Subspace maximum margin clustering (QG, JZ), pp. 1337–1346.
CIKMCIKM-2009-LinLK #named #novel #similarity
MatchSim: a novel neighbor-based similarity measure with maximum neighborhood matching (ZL, MRL, IK), pp. 1613–1616.
ICMLICML-2009-GiesekePK #clustering #performance
Fast evolutionary maximum margin clustering (FG, TP, OK), pp. 361–368.
ICMLICML-2009-ZhuAX #classification #modelling #named #topic
MedLDA: maximum margin supervised topic models for regression and classification (JZ, AA, EPX), pp. 1257–1264.
RecSysRecSys-2009-WeimerKB #matrix #recommendation
Maximum margin matrix factorization for code recommendation (MW, AK, MB), pp. 309–312.
GPCEGPCE-2009-NedunuriC #performance #problem #source code #synthesis
Synthesis of fast programs for maximum segment sum problems (SN, WRC), pp. 117–126.
ASPLOSASPLOS-2009-HofmannRW
Maximum benefit from a minimal HTM (OSH, CJR, EW), pp. 145–156.
DATEDATE-2008-Marques-SilvaP #algorithm #satisfiability #using
Algorithms for Maximum Satisfiability using Unsatisfiable Cores (JMS, JP), pp. 408–413.
PEPMPEPM-2008-Mu #algorithm #bound #problem
Maximum segment sum is back: deriving algorithms for two segment problems with bounded lengths (SCM), pp. 31–39.
ICALPICALP-A-2008-CheboluFM #graph #random
Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time (PC, AMF, PM), pp. 161–172.
CIKMCIKM-2008-AnnexsteinS #clustering #collaboration #user satisfaction
Collaborative partitioning with maximum user satisfaction (FSA, SS), pp. 1445–1446.
ECIRECIR-2008-YahyaeiM #email #retrieval
Applying Maximum Entropy to Known-Item Email Retrieval (SY, CM), pp. 406–413.
ICMLICML-2008-DembczynskiKS
Maximum likelihood rule ensembles (KD, WK, RS), pp. 224–231.
ICMLICML-2008-KuzelkaZ #estimation #first-order #performance
Fast estimation of first-order clause coverage through randomization and maximum likelihood (OK, FZ), pp. 504–511.
ICMLICML-2008-ZhaoWZ #clustering #multi #performance
Efficient multiclass maximum margin clustering (BZ, FW, CZ), pp. 1248–1255.
ICMLICML-2008-ZhuXZ #markov #network
Laplace maximum margin Markov networks (JZ, EPX, BZ), pp. 1256–1263.
ICPRICPR-2008-ChivertonMX #difference #similarity
Variational Maximum A Posteriori model similarity and dissimilarity matching (JC, MM, XX), pp. 1–4.
ICPRICPR-2008-PiccardiGO #classification #modelling #reduction
Maximum-likelihood dimensionality reduction in gaussian mixture models with an application to object classification (MP, HG, AFO), pp. 1–4.
ICPRICPR-2008-WangYY #analysis #fuzzy #recognition
Fuzzy maximum scatter discriminant analysis and its application to face recognition (JW, WY, JY), pp. 1–4.
ICPRICPR-2008-YangWRY #feature model
Feature Extraction base on Local Maximum Margin Criterion (WY, JW, MR, JY), pp. 1–4.
ICPRICPR-2008-ZhangD #comprehension #visual notation
Understanding visual dictionaries via Maximum Mutual Information curves (WZ, HD), pp. 1–4.
SACSAC-2008-LevadaMTS #estimation #higher-order #parametricity #pseudo
Spatially non-homogeneous potts model parameter estimation on higher-order neighborhood systems by maximum pseudo-likelihood (ALML, NDAM, AT, DHPS), pp. 1733–1737.
ICSTSAT-2008-Marques-SilvaM #algorithm #effectiveness #satisfiability #towards
Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms (JMS, VMM), pp. 225–230.
DATEDATE-2007-MangassarianVSNA #estimation #process #pseudo #satisfiability #using
Maximum circuit activity estimation using pseudo-boolean satisfiability (HM, AGV, SS, FNN, MSA), pp. 1538–1543.
STOCSTOC-2007-HayesVV #graph
Randomly coloring planar graphs with fewer colors than the maximum degree (TPH, JCV, EV), pp. 450–458.
ICALPICALP-2007-AlonFGKS #algorithm #problem
Parameterized Algorithms for Directed Maximum Leaf Problems (NA, FVF, GG, MK, SS), pp. 352–362.
ICMLICML-2007-DudikBS #estimation
Hierarchical maximum entropy density estimation (MD, DMB, RES), pp. 249–256.
ICMLICML-2007-TsampoukaS #algorithm #approximate
Approximate maximum margin algorithms with rules controlled by the number of mistakes (PT, JST), pp. 903–910.
ICMLICML-2007-ZhangTK #clustering
Maximum margin clustering made practical (KZ, IWT, JTK), pp. 1119–1126.
SIGIRSIGIR-2007-ZhangX #estimation #modelling #performance
Fast exact maximum likelihood estimation for mixture of language models (YZ, WX), pp. 865–866.
RTARTA-2007-Tatsuta #λ-calculus #μ-calculus
The Maximum Length of μ-Reduction in λμ-Calculus (MT), pp. 359–373.
STOCSTOC-2006-VassilevskaW #3d
Finding a maximum weight triangle in n3-Delta time, with applications (VV, RW), pp. 225–231.
ICMLICML-2006-BezakovaKS #graph #using
Graph model selection using maximum likelihood (IB, AK, RS), pp. 105–112.
ICMLICML-2006-DeCoste #collaboration #matrix #predict #using
Collaborative prediction using ensembles of Maximum Margin Matrix Factorizations (DD), pp. 249–256.
ICMLICML-2006-RatliffBZ
Maximum margin planning (NDR, JAB, MZ), pp. 729–736.
ICPRICPR-v1-2006-MiaoQS #composition #principle #using
Unsupervised Decomposition of Mixed Pixels Using the Maximum Entropy Principle (LM, HQ, HS), pp. 1067–1070.
ICPRICPR-v1-2006-YanCK #algorithm #probability #video
A Maximum A Posteriori Probability Viterbi Data Association Algorithm for Ball Tracking in Sports Video (FY, WJC, JK), pp. 279–282.
ICPRICPR-v2-2006-SunV #detection #linear #multi #performance #using
Fast Linear Feature Detection Using Multiple Directional Non-Maximum Suppression (CS, PV), pp. 288–291.
ICPRICPR-v2-2006-XuWH #algorithm #learning
A maximum margin discriminative learning algorithm for temporal signals (WX, JW, ZH), pp. 460–463.
ICPRICPR-v2-2006-YokobayashiW #correlation #recognition #using
Binarization and Recognition of Degraded Characters Using a Maximum Separability Axis in Color Space and GAT Correlation (MY, TW), pp. 885–888.
ICPRICPR-v3-2006-JoshiNLS #approach #correlation
A Maximum-Likelihood Approach to Symbolic Indirect Correlation (AJ, GN, DPL, SCS), pp. 99–103.
ICPRICPR-v3-2006-LiuZ
Minimum Enclosing and Maximum Excluding Machine for Pattern Description and Discrimination (YL, YFZ), pp. 129–132.
ICPRICPR-v3-2006-NeubeckG #performance
Efficient Non-Maximum Suppression (AN, LJVG), pp. 850–855.
KDDKDD-2006-LingSBM #development #mining
Maximum profit mining and its application in software development (CXL, VSS, TFWB, NHM), pp. 929–934.
CCCC-2006-XueK #fresh look #problem
A Fresh Look at PRE as a Maximum Flow Problem (JX, JK), pp. 139–154.
VLDBVLDB-2005-KarrasM #metric
One-Pass Wavelet Synopses for Maximum-Error Metrics (PK, NM), pp. 421–432.
ICMLICML-2005-RennieS #collaboration #matrix #performance #predict
Fast maximum margin matrix factorization for collaborative prediction (JDMR, NS), pp. 713–719.
KDDKDD-2005-JinZM #collaboration #recommendation #web
A maximum entropy web recommendation system: combining collaborative and content features (XJ, YZ, BM), pp. 612–617.
SIGIRSIGIR-2005-AslamYP #metric #retrieval
The maximum entropy method for analyzing retrieval measures (JAA, EY, VP), pp. 27–34.
SIGIRSIGIR-2005-LiuJC #information retrieval
A maximum coherence model for dictionary-based cross-language information retrieval (YL, RJ, JYC), pp. 536–543.
SIGIRSIGIR-2005-ZhuJXG #classification #multi #using
Multi-labelled classification using maximum entropy method (SZ, XJ, WX, YG), pp. 274–281.
SACSAC-2005-HuangCC #algorithm #approximate #type inference
An approximation algorithm for haplotype inference by maximum parsimony (YTH, KMC, TC), pp. 146–150.
ICSTSAT-2005-MaarenN #satisfiability
Sums of Squares, Satisfiability and Maximum Satisfiability (HvM, LvN), pp. 294–308.
PODSPODS-2004-GarofalakisK #metric
Deterministic Wavelet Thresholding for Maximum-Error Metrics (MNG, AK), pp. 166–176.
DLTDLT-2004-ChoffrutGL #on the
On the Maximum Coefficients of Rational Formal Series in Commuting Variables (CC, MG, VL), pp. 114–126.
ICMLICML-2004-BanerjeeDGM #analysis #estimation #exponential #product line
An information theoretic analysis of maximum likelihood mixture estimation for exponential families (AB, ISD, JG, SM).
ICMLICML-2004-PhillipsDS #approach #modelling
A maximum entropy approach to species distribution modeling (SJP, MD, RES).
ICPRICPR-v3-2004-JagmohanSA #estimation #kernel #using
Dense Stereo Matching Using Kernel Maximum Likelihood Estimation (AJ, MKS, NA), pp. 28–31.
KDDKDD-2004-BanerjeeDGMM #approach #approximate #clustering #matrix
A generalized maximum entropy approach to bregman co-clustering and matrix approximation (AB, ISD, JG, SM, DSM), pp. 509–514.
KDDKDD-2004-YanZYYLCXFMC #incremental #named
IMMC: incremental maximum margin criterion (JY, BZ, SY, QY, HL, ZC, WX, WF, WYM, QC), pp. 725–730.
SACSAC-2004-KatayamaHN #clique #problem
Solving the maximum clique problem by k-opt local search (KK, AH, HN), pp. 1021–1025.
SACSAC-2004-StamatakisLM #performance #scalability
A fast program for maximum likelihood-based inference of large phylogenetic trees (AS, TL, HM), pp. 197–201.
ICSMEICSM-2003-Mul #internet #legacy
Making maximum use of legacy code: Transavia internet booking engine (CM), p. 466.
CIAACIAA-2003-FanLLTWY #algorithm
An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract (THF, SL, HIL, TST, TCW, AY), pp. 251–257.
ICMLICML-2003-PavlovPPU #modelling
Mixtures of Conditional Maximum Entropy Models (DP, AP, DMP, LHU), pp. 584–591.
ICMLICML-2003-WangSPZ #learning #modelling #principle
Learning Mixture Models with the Latent Maximum Entropy Principle (SW, DS, FP, YZ), pp. 784–791.
DACDAC-2002-EderB #logic #performance #pipes and filters #verification
Achieving maximum performance: a method for the verification of interlocked pipeline control logic (KE, GB), pp. 135–140.
STOCSTOC-2002-Molloy #graph
The Glauber dynamics on colourings of a graph with high girth and maximum degree (MM), pp. 91–98.
ICALPICALP-2002-Radzik #bound #network
Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network (TR), pp. 611–622.
ICMLICML-2002-LuPS
Investigating the Maximum Likelihood Alternative to TD(λ) (FL, RP, DS), pp. 403–410.
ICMLICML-2002-OliverG #markov #modelling #named
MMIHMM: Maximum Mutual Information Hidden Markov Models (NO, AG), pp. 466–473.
ICMLICML-2002-ParkZ #learning
A Boosted Maximum Entropy Model for Learning Text Chunking (SBP, BTZ), pp. 482–489.
ICPRICPR-v1-2002-JunTD #estimation #multi #segmentation
Multiple Objects Segmentation Based on Maximum-Likelihood Estimation and Optimum Entropy-Distribution (MLE-OED) (JX, HTT, DX), p. 707–?.
ICPRICPR-v4-2002-ZucchelliSC02a #estimation
Maximum Likelihood Structure and Motion Estimation Integrated over Tim (MZ, JSV, HIC), pp. 260–263.
SACSAC-2002-ButenkoPSSS #graph #independence #set
Finding maximum independent sets in graphs arising from coding theory (SB, PMP, IS, VS, PS), pp. 542–546.
DATEDATE-2001-WormLW #architecture #design #performance #power management
Design of low-power high-speed maximum a priori decoder architectures (AW, HL, NW), pp. 258–267.
ICDARICDAR-2001-SendaY #approach #recognition
A Maximum-Likelihood Approach to Segmentation-Based Recognition of Unconstrained Handwriting Text (SS, KY), pp. 184–188.
STOCSTOC-2001-MolloyR #graph
Colouring graphs when the number of colours is nearly the maximum degree (MM, BAR), pp. 462–470.
SIGIRSIGIR-2001-ZhangC #estimation
Maximum Likelihood Estimation for Filtering Thresholds (YZ, JPC), pp. 294–302.
GPCESAIG-2001-SasanoHT #generative #multi #performance #problem #source code
Generation of Efficient Programs for Solving Maximum Multi-marking Problems (IS, ZH, MT), pp. 72–91.
ICFPICFP-2000-SasanoHTO #algorithm #linear #problem
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems (IS, ZH, MT, MO), pp. 137–149.
ICMLICML-2000-McCallumFP #information management #markov #modelling #segmentation
Maximum Entropy Markov Models for Information Extraction and Segmentation (AM, DF, FCNP), pp. 591–598.
ICMLICML-2000-WesterdijkW #classification #modelling #multi #using
Classification with Multiple Latent Variable Models using Maximum Entropy Discrimination (MW, WW), pp. 1143–1150.
ICPRICPR-v1-2000-SebeL
Maximum Likelihood Stereo Matching (NS, MSL), pp. 1900–1903.
ICPRICPR-v2-2000-LauYT #algorithm #image
EDT Based Tracing Maximum Thinning Algorithm on Grey Scale Images (KKL, PCY, YYT), pp. 2863–2866.
ICPRICPR-v2-2000-Takeda #estimation
Maximum Likelihood Estimation of a Sensor Configuration in a Polygonal Environment (HT), pp. 2446–2450.
ICPRICPR-v3-2000-CohenD #estimation #image
Motion Estimation in Noisy Ultrasound Images by Maximum Likelihood (BC, ID), pp. 3186–3189.
ICPRICPR-v3-2000-LuoT #approach #multi #using
Multi-Level Thresholding: Maximum Entropy Approach Using ICM (XL, JT), pp. 3786–3789.
ICPRICPR-v3-2000-MateiM #bias #reduction
Reduction of Bias in Maximum Likelihood Ellipse Fitting (BM, PM), pp. 3802–3806.
SACSAC-2000-WuL #clustering #fuzzy #named #network
F3MCNN: A Fuzzy Minimum Mean Maximum Clustering Neural Network (LGW, HL), pp. 10–14.
STOCSTOC-1999-GabowKT #algorithm
Unique Maximum Matching Algorithms (HNG, HK, RET), pp. 70–78.
DACDAC-1998-QiuWP #estimation #order #statistics #using
Maximum Power Estimation Using the Limiting Distributions of Extreme Order Statistics (QQ, QW, MP), pp. 684–689.
DATEDATE-1998-JiangC #approximate #estimation
Exact and Approximate Estimation for Maximum Instantaneous Current of CMOS Circuits (YMJ, KTC), pp. 698–702.
STOCSTOC-1998-KargerL #graph
Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching (DRK, MSL), pp. 69–78.
ICPRICPR-1998-ColmenarezH #detection #fault
Pattern detection with information-based maximum discrimination and error bootstrapping (AC, TSH), pp. 222–224.
ICPRICPR-1998-Gimelfarb98a #image #modelling #on the #random
On the maximum likelihood potential estimates for Gibbs random field image models (GLG), pp. 1598–1600.
ICPRICPR-1998-NicollsJ #estimation
Maximum likelihood estimation of Toeplitz-block-Toeplitz covariances in the presence of subspace interference (FN, GdJ), pp. 1595–1597.
SACSAC-1998-LimaR #classification
Maximum likelihood based classification for the microstructure of human sleep (JAL, ACR), pp. 60–64.
SACSAC-1998-Marchiori98a #algorithm #clique #heuristic #problem #search-based
A simple heuristic based genetic algorithm for the maximum clique problem (EM), pp. 366–373.
DACDAC-1997-KrsticC #generative
Vector Generation for Maximum Instantaneous Current Through Supply Lines for CMOS Circuits (AK, KTC), pp. 383–388.
STOCSTOC-1997-Karger #graph #random #using
Using Random Sampling to Find Maximum Flows in Uncapacitated Undirected Graphs (DRK), pp. 240–249.
STOCSTOC-1996-McCormick #algorithm #parametricity #performance #scheduling
Fast Algorithms for Parametric Scheduling Come from Extensions to Parametric Maximum Flow (STM), pp. 319–328.
ICALPICALP-1996-Chen #approximate #graph #problem
Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs (ZZC), pp. 268–279.
ICPRICPR-1996-Grim #design #network
Maximum-likelihood design of layered neural networks (JG), pp. 85–89.
DACDAC-1995-MannePBHSMP
Computing the Maximum Power Cycles of a Sequential Circuit (SM, AP, RIB, GDH, FS, EM, MP), pp. 23–28.
STOCSTOC-1994-Odlyzko #random
Search for the maximum of a random walk (AMO), pp. 336–345.
DACDAC-1993-KriplaniNYH #correlation
Resolving Signal Correlations for Estimating Maximum Currents in CMOS Combinational Circuits (HK, FNN, PY, INH), pp. 384–388.
STOCSTOC-1993-FelsnerW #algorithm #combinator #set
Maximum k-chains in planar point sets: combinatorial structure and algorithms (SF, LW), pp. 146–153.
ICALPICALP-1993-LundY #approximate #problem
The Approximation of Maximum Subgraph Problems (CL, MY), pp. 40–51.
DACDAC-1992-KriplaniNH #estimation
Maximum Current Estimation in CMOS Circuits (HK, FNN, INH), pp. 2–7.
LICSLICS-1992-GroveHK #random
Random Worlds and Maximum Entropy (AJG, JYH, DK), pp. 22–33.
PODSPODS-1991-GangulyGZ #logic programming
Minimum and Maximum Predicates in Logic Programming (SG, SG, CZ), pp. 154–163.
KDDKDD-1991-ChiuWC #synthesis
Information Discovery through Hierarchical Maximum Entropy Discretization and Synthesis (DKYC, AKCW, BC), pp. 125–140.
CAVCAV-1991-Courcoubetis #problem #realtime
Minimum and Maximum Delay Problems in Real-Time Systems (CC), pp. 399–409.
STOCSTOC-1990-EvenR #distributed #network
The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract) (SE, SR), pp. 95–105.
ICALPICALP-1990-Blum #approach #graph
A New Approach to Maximum Matching in General Graphs (NB), pp. 586–597.
ICALPICALP-1990-CheriyanHM #question
Can A Maximum Flow be Computed on o(nm) Time? (JC, TH, KM), pp. 235–248.
ICALPICALP-1989-Kenyon-MathieuV #analysis #data type
General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract) (CKM, JSV), pp. 473–487.
STOCSTOC-1986-GoldbergT #approach #problem
A New Approach to the Maximum Flow Problem (AVG, RET), pp. 136–146.
SIGIRSIGIR-1986-KantorL #information retrieval
The Maximum Entropy Principle in Information Retrieval (PBK, JJL), pp. 269–274.
POPLPOPL-1986-JohnsonW #approach #incremental #type inference
A Maximum-Flow Approach to Anomaly Isolation in Unification-Based Incremental Type Inference (GFJ, JAW), pp. 44–57.
STOCSTOC-1984-Blum #layout #trade-off
An Area-Maximum Edge Length Tradeoff for VLSI Layout (NB), pp. 92–97.
VLDBVLDB-1982-Xu #concurrent #formal method #transaction
A Formal Model for Maximum Concurrency in Transaction Systems with Predeclared Writesets (JX), pp. 77–90.
STOCSTOC-1982-PachlKR #algorithm #bound #distributed #proving
A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms (JKP, EK, DR), pp. 378–382.
STOCSTOC-1978-Lewis #complexity #on the #problem
On the Complexity of the Maximum Subgraph Problem (JML), pp. 265–274.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.