Stem maxim$ (all stems)

278 papers:

CASE-2015-ChenH #assembly #automation #distributed #petri net #using

Maximally permissive distributed control of automated manufacturing systems with assembly operations using Petri nets (CC, HH), pp. 532–538.

CASE-2015-XuZLW #order #probability #scheduling #throughput

Stochastic customer order scheduling to maximize throughput (XX, YZ, HL, MW), pp. 665–670.

DATE-2015-FuZLX #manycore #memory management

Maximizing common idle time on multi-core processors with shared memory (CF, YZ, ML, CJX), pp. 900–903.

DATE-2015-LiSGWXZS #memory management #performance #reduction

Maximizing IO performance via conflict reduction for flash memory storage systems (QL, LS, CG, KW, CJX, QZ, EHMS), pp. 904–907.

SIGMOD-2015-BerlowitzCK #performance

Efficient Enumeration of Maximal k-Plexes (DB, SC, BK), pp. 431–444.

SIGMOD-2015-LiBCGM #named #network #towards

GetReal: Towards Realistic Selection of Influence Maximization Strategies in Competitive Networks (HL, SSB, JC, YG, JM), pp. 1525–1537.

SIGMOD-2015-TangSX #approach

Influence Maximization in Near-Linear Time: A Martingale Approach (YT, YS, XX), pp. 1539–1554.

VLDB-2015-ChenFLFTT #online #topic

Online Topic-Aware Influence Maximization (SC, JF, GL, JF, KLT, JT), pp. 666–677.

VLDB-2015-DoLW #mining

Mining Revenue-Maximizing Bundling Configuration (LD, HWL, KW), pp. 593–604.

VLDB-2015-LiZT #online #realtime

Real-time Targeted Influence Maximization for Online Advertisements (YL, DZ, KLT), pp. 1070–1081.

VLDB-2015-ZhangWYGLZ #in memory #named #throughput

Mega-KV: A Case for GPUs to Maximize the Throughput of In-Memory Key-Value Stores (KZ, KW, YY, LG, RL, XZ), pp. 1226–1237.

PLDI-2015-Huang #concurrent #model checking #reduction #source code

Stateless model checking concurrent programs with maximal causality reduction (JH), pp. 165–174.

STOC-2015-KorulaMZ #online #order #random

Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (NK, VSM, MZ), pp. 889–898.

STOC-2015-MirrokniZ #composition #distributed #random

Randomized Composable Core-sets for Distributed Submodular Maximization (VSM, MZ), pp. 153–162.

ICALP-v1-2015-ChekuriGQ #algorithm #streaming

Streaming Algorithms for Submodular Function Maximization (CC, SG, KQ), pp. 318–330.

ICML-2015-BarbosaENW #dataset #distributed #power of

The Power of Randomization: Distributed Submodular Maximization on Massive Datasets (RdPB, AE, HLN, JW), pp. 1236–1244.

ICML-2015-KarN0 #precise

Surrogate Functions for Maximizing Precision at the Top (PK, HN, PJ), pp. 189–198.

ICML-2015-SharmaKD #on the

On Greedy Maximization of Entropy (DS, AK, AD), pp. 1330–1338.

KDD-2015-LeiMMCS #online

Online Influence Maximization (SL, SM, LM, RC, PS), pp. 645–654.

KDD-2015-LinLC #framework #multi #network #social

A Learning-based Framework to Handle Multi-round Multi-party Influence Maximization on Social Networks (SCL, SDL, MSC), pp. 695–704.

KDD-2015-TengTYC #constraints #effectiveness

An Effective Marketing Strategy for Revenue Maximization with a Quantity Constraint (YWT, CHT, PSY, MSC), pp. 1175–1184.

SEKE-2015-XuZHX

A Balanced Method for Budgeted Influence Maximization (XX, YZ, QH, CX), pp. 250–255.

SIGIR-2015-XiaXLGC #evaluation #learning #metric #optimisation

Learning Maximal Marginal Relevance Model via Directly Optimizing Diversity Evaluation Measures (LX, JX, YL, JG, XC), pp. 113–122.

CADE-2015-SatoW #dependence #encoding

Encoding Dependency Pair Techniques and Control Strategies for Maximal Completion (HS, SW), pp. 152–162.

CSL-2015-MazowieckiR #automaton #logic #towards

Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata (FM, CR), pp. 144–159.

SAT-2015-KullmannM #query

Computing Maximal Autarkies with Few and Simple Oracle Queries (OK, JMS), pp. 138–155.

PODS-2014-IndykMMM #composition

Composable core-sets for diversity and coverage maximization (PI, SM, MM, VSM), pp. 100–108.

SIGMOD-2014-LiCFTL #performance

Efficient location-aware influence maximization (GL, SC, JF, KLT, WSL), pp. 87–98.

SIGMOD-2014-TangXS #complexity #performance

Influence maximization: near-optimal time complexity meets practical efficiency (YT, XX, YS), pp. 75–86.

VLDB-2014-LuCLL #recommendation

Show Me the Money: Dynamic Recommendations for Revenue Maximization (WL, SC, KL, LVSL), pp. 1785–1796.

FoSSaCS-2014-Fu #bound #markov #probability #process #reachability

Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes (HF), pp. 73–87.

PLDI-2014-HuangMR #abstraction #concurrent #control flow #detection #predict

Maximal sound predictive race detection with control flow abstraction (JH, POM, GR), p. 36.

STOC-2014-ColeR #complexity

The sample complexity of revenue maximization (RC, TR), pp. 243–252.

STOC-2014-Vegh #algorithm #polynomial

A strongly polynomial algorithm for generalized flow maximization (LAV), pp. 644–653.

AFL-2014-BrzozowskiD13

Maximally Atomic Languages (JAB, GD), pp. 151–161.

ICFP-2014-GrabmayerR #λ-calculus

Maximal sharing in the λ calculus with letrec (CG, JR), pp. 67–80.

DUXU-DP-2014-ShafiqCIFAAI #design #effectiveness #interactive #personalisation #visual notation

Skill Specific Spoken Dialogues Based Personalized ATM Design to Maximize Effective Interaction for Visually Impaired Persona (MS, JGC, MI, MF, MA, IA, AI), pp. 446–457.

CIKM-2014-CohenDPW #scalability #sketching

Sketch-based Influence Maximization and Computation: Scaling up with Guarantees (EC, DD, TP, RFW), pp. 629–638.

CIKM-2014-DongYMLSWWGY #multi #statistics

Maximizing Multi-scale Spatial Statistical Discrepancy (WD, RY, CM, CL, LS, LW, YW, PG, JY), pp. 471–480.

CIKM-2014-LiuXCXTY #approach #bound #linear #network #scalability #social

Influence Maximization over Large-Scale Social Networks: A Bounded Linear Approach (QL, BX, EC, HX, FT, JXY), pp. 171–180.

ECIR-2014-GaoWO #comparison #using

Reducing Reliance on Relevance Judgments for System Comparison by Using Expectation-Maximization (NG, WW, DWO), pp. 1–12.

ICML-c2-2014-NguyenMVEB #analysis #correlation #multi

Multivariate Maximal Correlation Analysis (HVN, EM, JV, PE, KB), pp. 775–783.

ICML-c2-2014-WangNH #distance #learning #metric #robust

Robust Distance Metric Learning via Simultaneous L1-Norm Minimization and Maximization (HW, FN, HH), pp. 1836–1844.

ICML-c2-2014-WeiIB #multi #performance

Fast Multi-stage Submodular Maximization (KW, RKI, JAB), pp. 1494–1502.

ICPR-2014-HedjamCK #detection #documentation #energy #image #multi #self

Constrained Energy Maximization and Self-Referencing Method for Invisible Ink Detection from Multispectral Historical Document Images (RH, MC, MK), pp. 3026–3031.

ICPR-2014-SouzaRML

Maximal Max-Tree Simplification (RS, LR, RCM, RdAL), pp. 3132–3137.

ICPR-2014-TianLST #multi #segmentation

Scene Text Segmentation with Multi-level Maximally Stable Extremal Regions (ST, SL, BS, CLT), pp. 2703–2708.

KDD-2014-BadanidiyuruMKK #on the fly #streaming #summary

Streaming submodular maximization: massive data summarization on the fly (AB, BM, AK, AK), pp. 671–680.

KDD-2014-GolshanLT #clustering

Profit-maximizing cluster hires (BG, TL, ET), pp. 1196–1205.

KDD-2014-HeK

Stability of influence maximization (XH, DK), pp. 1256–1265.

KDD-2014-XieGFTY

Class-distribution regularized consensus maximization for alleviating overfitting in model combination (SX, JG, WF, DST, PSY), pp. 303–312.

SIGIR-2014-ChengSHCC #named #ranking #self

IMRank: influence maximization via finding self-consistent ranking (SC, HS, JH, WC, XC), pp. 475–484.

SAC-2014-GraziadioDSSUME #game studies #identification #video

Bespoke video games to provide early response markers to identify the optimal strategies for maximizing rehabilitation (SG, RD, KS, KMAS, GU, GM, JAE), pp. 20–24.

HPCA-2014-JungK #named #resource management

Sprinkler: Maximizing resource utilization in many-chip solid state disks (MJ, MTK), pp. 524–535.

HPDC-2014-IslamLWP #approach #named

SOR-HDFS: a SEDA-based approach to maximize overlapping in RDMA-enhanced HDFS (NSI, XL, MWuR, DKP), pp. 261–264.

CAV-2014-WijsKB #component #composition #graph

GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components (AW, JPK, DB), pp. 310–326.

CASE-2013-BentahaBD #composition #probability

A decomposition method for stochastic partial disassembly line balancing with profit maximization (MLB, OB, AD), pp. 404–409.

CASE-2013-GiulianiCP #analysis #optimisation

A computational analysis of nondifferentiable optimization: Applications to production maximization in gas-lifted oil fields (CMG, EC, AP), pp. 286–291.

CASE-2013-HuZL13a #automation #distributed #petri net #scalability

Maximally permissive distributed control of large scale automated manufacturing systems modeled with Petri nets (HH, MZ, YL), pp. 1145–1150.

DATE-2013-ChaG #approach #detection #effectiveness #metric

Trojan detection via delay measurements: a new approach to select paths and vectors to maximize effectiveness and minimize cost (BC, SKG), pp. 1265–1270.

DATE-2013-ZhaoOX #process #synthesis

Profit maximization through process variation aware high level synthesis with speed binning (MZ, AO, CJX), pp. 176–181.

PODS-2013-KimelfeldK #complexity #mining

The complexity of mining maximal frequent subgraphs (BK, PGK), pp. 13–24.

SIGMOD-2013-WangHRN

Utility-maximizing event stream suppression (DW, YH, EAR, JFN), pp. 589–600.

SIGMOD-2013-YakoutBE #automation #bound #scalability

Don’t be SCAREd: use SCalable Automatic REpairing with maximal likelihood and bounded changes (MY, LBE, AKE), pp. 553–564.

VLDB-2013-Franceschini #approach #big data #how #open source

How to maximize the value of big data with the open source SpagoBI suite through a comprehensive approach (MF), pp. 1170–1171.

CSEET-2013-InagaWYKFYOKTK #development #education #effectiveness

Team characteristics for maximizing the educational effectiveness of practical lectures on software intensive systems development (SI, HW, YY, KK, YF, SY, MO, TK, MT, TK), pp. 264–268.

STOC-2013-NeimanS #algorithm

Simple deterministic algorithms for fully dynamic maximal matching (ON, SS), pp. 745–754.

ICALP-v2-2013-Basset #automaton #probability #process

A Maximal Entropy Stochastic Process for a Timed Automaton, (NB), pp. 61–73.

ICALP-v2-2013-CelisGK #information management #on the

On Revenue Maximization for Agents with Costly Information Acquisition — Extended Abstract (LEC, DCG, ARK), pp. 484–495.

LATA-2013-BiondiLNW #markov #process

Maximizing Entropy over Markov Processes (FB, AL, BFN, AW), pp. 128–140.

GT-VMT-2013-AlshanqitiHK #graph transformation #learning

Learning Minimal and Maximal Rules from Observations of Graph Transformations (AMA, RH, TAK).

DUXU-CXC-2013-HassB #testing #usability

Usability Testing Medical Devices: A Practical Guide to Minimizing Risk and Maximizing Success (CH, DB), pp. 407–416.

DUXU-WM-2013-MinJ #functional #named #using

TRIGGER: Maximizing Functional Effect of Using Products (KBM, ECJ), pp. 385–391.

CIKM-2013-AkibaIY #linear #network #random #scalability

Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction (TA, YI, YY), pp. 909–918.

CIKM-2013-ChengSHZC #named

StaticGreedy: solving the scalability-accuracy dilemma in influence maximization (SC, HS, JH, GZ, XC), pp. 509–518.

CIKM-2013-GuoZZCG #network #personalisation #social

Personalized influence maximization on social networks (JG, PZ, CZ, YC, LG), pp. 199–208.

CIKM-2013-WangYLZH #network #summary #topic #word

Content coverage maximization on word networks for hierarchical topic summarization (CW, XY, YL, CZ, JH), pp. 249–258.

ECIR-2013-NishinoYHSN #multi #summary

Text Summarization while Maximizing Multiple Objectives with Lagrangian Relaxation (MN, NY, TH, JS, MN), pp. 772–775.

ICML-c3-2013-ReedG #process #scalability

Scaling the Indian Buffet Process via Submodular Maximization (CR, ZG), pp. 1013–1021.

KDD-2013-AbbassiMT #constraints

Diversity maximization under matroid constraints (ZA, VSM, MT), pp. 32–40.

KDD-2013-AltinigneliPB #parallel #using

Massively parallel expectation maximization using graphics processing units (MCA, CP, CB), pp. 838–846.

KDD-2013-WangCF #clique

Redundancy-aware maximal cliques (JW, JC, AWCF), pp. 122–130.

KDD-2013-YangHLC #network #online #probability #social

Maximizing acceptance probability for active friending in online social networks (DNY, HJH, WCL, WC), pp. 713–721.

MLDM-2013-AllahSG #algorithm #array #dataset #mining #performance #scalability

An Efficient and Scalable Algorithm for Mining Maximal — High Confidence Rules from Microarray Dataset (WZAA, YKES, FFMG), pp. 352–366.

RecSys-2013-AzariaHKEWN #recommendation

Movie recommender system for profit maximization (AA, AH, SK, AE, OW, IN), pp. 121–128.

SAC-2013-KimGKTSK #optimisation

Maximizing availability of content in disruptive environments by cross-layer optimization (MK, AG, JMK, DT, MOS, JSK), pp. 447–454.

HPCA-2013-BaekLNLK #capacity #effectiveness #named

ECM: Effective Capacity Maximizer for high-performance compressed caching (SB, HGL, CN, JL, JK), pp. 131–142.

HPCA-2013-ChangHPNXK #named #network

TS-Router: On maximizing the Quality-of-Allocation in the On-Chip Network (YYC, YSCH, MP, VN, YX, CTK), pp. 390–399.

ASE-2012-GongLJZ #fault #locality

Diversity maximization speedup for fault localization (LG, DL, LJ, HZ), pp. 30–39.

CASE-2012-ViswanadhamCND #social

Mandi electronic exchange: Orchestrating Indian agricultural markets for maximizing social welfare (NV, SC, YN, PD), pp. 992–997.

HT-2012-ShenSNT #network #online #social #trust

Maximizing circle of trust in online social networks (YS, YSS, DTN, MTT), pp. 155–164.

VLDB-2012-ChoiCT #algorithm #database #scalability

A Scalable Algorithm for Maximizing Range Sum in Spatial Databases (DWC, CWC, YT), pp. 1088–1099.

ITiCSE-2012-BoyceCPCB #behaviour #game studies #learning

Maximizing learning and guiding behavior in free play user generated content environments (AKB, AC, SP, DC, TB), pp. 10–15.

ICALP-v1-2012-AzarG #constraints #linear #performance

Efficient Submodular Function Maximization under Linear Packing Constraints (YA, IG), pp. 38–50.

ICALP-v1-2012-Bauwens #complexity

Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity (BB), pp. 100–108.

ICALP-v1-2012-BuchbinderNRS #algorithm #approximate #constraints #online #rank

Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints (NB, JN, RR, MS), pp. 145–156.

ICALP-v2-2012-Elbassioni #graph

A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs (KME), pp. 513–524.

ICALP-v2-2012-OchelRV #capacity #network #online

Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization (MO, KR, BV), pp. 648–659.

LATA-2012-BolligP #algorithm #performance

An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings (BB, TP), pp. 143–154.

FM-2012-AponteCMS #composition #invariant

Maximal and Compositional Pattern-Based Loop Invariants (MVA, PC, YM, MS), pp. 37–51.

ICEIS-v1-2012-DomagalaWLS #energy #hybrid

A Hybrid Solver for Maximizing the Profit of an Energy Company (LD, TW, WL, MS), pp. 278–283.

CIKM-2012-CaiZ #injection #learning #rank

Variance maximization via noise injection for active sampling in learning to rank (WC, YZ), pp. 1809–1813.

CIKM-2012-DuttingHW #recommendation #trust

Maximizing revenue from strategic recommendations under decaying trust (PD, MH, IW), pp. 2283–2286.

CIKM-2012-LappasT

Daily-deal selection for revenue maximization (TL, ET), pp. 565–574.

CIKM-2012-SunHCZD #capacity #constraints

Location selection for utility maximization with capacity constraints (YS, JH, YC, RZ, XD), pp. 2154–2158.

ECIR-2012-DaiPKA

Extended Expectation Maximization for Inferring Score Distributions (KD, VP, EK, JAA), pp. 293–304.

ICML-2012-BorboudakisT #constraints #graph #information management #network

Incorporating Causal Prior Knowledge as Path-Constraints in Bayesian Networks and Maximal Ancestral Graphs (GB, IT), p. 59.

ICML-2012-Gomez-RodriguezS #network

Influence Maximization in Continuous Time Diffusion Networks (MGR, BS), p. 78.

ICML-2012-WangC12a #clustering

Clustering to Maximize the Ratio of Split to Diameter (JW, JC), p. 74.

ICPR-2012-Goldstein #algorithm #detection #named

FastLOF: An Expectation-Maximization based Local Outlier detection algorithm (MG), pp. 2282–2285.

ICPR-2012-WangPLQHJ #detection

Color Maximal-Dissimilarity Pattern for pedestrian detection (QW, JP, GL, LQ, QH, SJ), pp. 1952–1955.

KDD-2012-ChenCL #game studies #multi #network #social

Information propagation game: a tool to acquire humanplaying data for multiplayer influence maximization on social networks (HHC, YBC, SDL), pp. 1524–1527.

KDD-2012-ChengZKC #algorithm #clique #memory management #performance

Fast algorithms for maximal clique enumeration with limited memory (JC, LZ, YK, SC), pp. 1240–1248.

KDD-2012-Holada #low cost

Maximizing return and minimizing cost with the right decision management systems (RH), p. 407.

RecSys-2012-ShiKBLOH #collaboration #learning #named #rank

CLiMF: learning to maximize reciprocal rank with collaborative less-is-more filtering (YS, AK, LB, ML, NO, AH), pp. 139–146.

CASE-2011-GhirardiPS #case study #multimodal #throughput

Maximizing the throughput of multimodal logistic platforms by simulation-optimization: The Duferco case study (MG, GP, DS), pp. 52–57.

CASE-2011-NazeemR #classification #concurrent #design #policy #resource management

Designing maximally permissive deadlock avoidance policies for sequential resource allocation systems through classification theory (AN, SAR), pp. 405–412.

CASE-2011-WangZW #petri net

Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets (SW, MZ, CW), pp. 399–404.

DAC-2011-HuangQFQ #constraints #realtime #throughput

Throughput maximization for periodic real-time systems under the maximal temperature constraint (HH, GQ, JF, MQ), pp. 363–368.

ICDAR-2011-YangW #segmentation #visual notation

Segmentation of Graphical Objects as Maximally Stable Salient Regions (SY, YW), pp. 187–191.

PODS-2011-KimelfeldVW

Maximizing conjunctive views in deletion propagation (BK, JV, RW), pp. 187–198.

VLDB-2012-GoyalBL11 #approach #data-driven #social

A Data-Based Approach to Social Influence Maximization (AG, FB, LVSL), pp. 73–84.

STOC-2011-VondrakCZ #multi

Submodular function maximization via the multilinear relaxation and contention resolution schemes (JV, CC, RZ), pp. 783–792.

ICALP-v1-2011-FeldmanNS #algorithm

Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm — (Extended Abstract) (MF, JN, RS), pp. 342–353.

ICALP-v1-2011-MakarychevS #constraints

Maximizing Polynomials Subject to Assignment Constraints (KM, MS), pp. 510–520.

ICEIS-J-2011-MasadaTSO #clustering #documentation #string

Clustering Documents with Maximal Substrings (TM, AT, YS, KO), pp. 19–34.

ICEIS-v1-2011-MasadaSO #clustering #documentation #feature model #string

Documents as a Bag of Maximal Substrings — An Unsupervised Feature Extraction for Document Clustering (TM, YS, KO), pp. 5–13.

ICEIS-v4-2011-SivasankariMKVP #energy #mobile #multi #network #performance

Multiple Mobile Synchronised Sinks (MMSS) for Energy Efficiency and Lifetime Maximization in Wireless Sensor Networks (HS, VM, KS, KRV, LMP), pp. 76–85.

CIKM-2011-LiYL #power of #predict #random

Link prediction: the power of maximal entropy random walk (RHL, JXY, JL), pp. 1147–1156.

CIKM-2011-OzertemVL #set #using

Suggestion set utility maximization using session logs (UO, EV, LL), pp. 105–114.

ICML-2011-SugiyamaYKH #clustering #on the #parametricity

On Information-Maximization Clustering: Tuning Parameter Selection and Analytic Solution (MS, MY, MK, HH), pp. 65–72.

ICML-2011-ZhaoHJY #online

Online AUC Maximization (PZ, SCHH, RJ, TY), pp. 233–240.

KDIR-2011-VanetikG #mining #named

HashMax: A New Method for Mining Maximal Frequent Itemsets (NV, EG), pp. 140–145.

SEKE-2011-AlencarTSDC

Maximizing the Financial Benefits Yielded by IT Projects While Ensuring their Strategic Fit (AJA, GT, EAS, AFdSD, ALC), pp. 288–295.

SIGIR-2011-TianL #information retrieval #interactive #learning

Active learning to maximize accuracy vs. effort in interactive information retrieval (AT, ML), pp. 145–154.

HPCA-2011-RanganPWB #performance #throughput

Achieving uniform performance and maximizing throughput in the presence of heterogeneity (KKR, MDP, GYW, DMB), pp. 3–14.

LICS-2011-BresolinMSS #decidability #logic #what

What’s Decidable about Halpern and Shoham’s Interval Logic? The Maximal Fragment ABBL (DB, AM, PS, GS), pp. 387–396.

RTA-2011-KleinH

Maximal Completion (DK, NH), pp. 71–80.

CASE-2010-NazeemR #approach #design #resource management

A practical approach to the design of maximally permissive liveness-enforcing supervisors for complex resource allocation systems (AN, SR), pp. 451–458.

DATE-2010-BonfiettiBLM #approach #manycore #performance #scheduling

An efficient and complete approach for throughput-maximal SDF allocation and scheduling on multi-core platforms (AB, LB, ML, MM), pp. 897–902.

DATE-2010-Mirza-AghatabarBG #algorithm #pipes and filters

Algorithms to maximize yield and enhance yield/area of pipeline circuitry by insertion of switches and redundant modules (MMA, MAB, SKG), pp. 1249–1254.

PODS-2010-ReS #comprehension #estimation #using

Understanding cardinality estimation using entropy maximization (CR, DS), pp. 53–64.

SIGMOD-2010-ChengKFYZ #clique #network

Finding maximal cliques in massive networks by H*-graph (JC, YK, AWCF, JXY, LZ), pp. 447–458.

VLDB-2010-CormodeLLS

Minimizing Minimality and Maximizing Utility: Analyzing Method-based attacks on Anonymized Data (GC, NL, TL, DS), pp. 1045–1056.

ICALP-v2-2010-MontanariPS #decidability #logic

Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals (AM, GP, PS), pp. 345–356.

LATA-2010-CrochemoreIKRRW #on the #polynomial #string

On the Maximal Number of Cubic Runs in a String (MC, CSI, MK, JR, WR, TW), pp. 227–238.

CIKM-2010-ShalemK

Computing the top-k maximal answers in a join of ranked lists (MS, YK), pp. 1381–1384.

CIKM-2010-ThurauKB #matrix

Yes we can: simplex volume maximization for descriptive web-scale matrix factorization (CT, KK, CB), pp. 1785–1788.

ICPR-2010-DonoserRB10a

Shape Guided Maximally Stable Extremal Region (MSER) Tracking (MD, HR, HB), pp. 1800–1803.

ICPR-2010-GuneyA

Maximally Stable Texture Regions (MG, NA), pp. 4549–4552.

ICPR-2010-MemonLM #modelling #verification

Information Theoretic Expectation Maximization Based Gaussian Mixture Modeling for Speaker Verification (SM, ML, NCM), pp. 4536–4540.

ICPR-2010-RicamatoT #effectiveness #question

AUC-based Combination of Dichotomizers: Is Whole Maximization also Effective for Partial Maximization? (MTR, FT), pp. 73–76.

ICPR-2010-XuHL #distance #reduction

Dimensionality Reduction by Minimal Distance Maximization (BX, KH, CLL), pp. 569–572.

KDD-2010-ChenWW #network #scalability #social

Scalable influence maximization for prevalent viral marketing in large-scale social networks (WC, CW, YW), pp. 1029–1038.

KR-2010-ArieliAZ #logic

Maximally Paraconsistent Three-Valued Logics (OA, AA, AZ).

SIGIR-2010-GuoS #probability

Probabilistic latent maximal marginal relevance (SG, SS), pp. 833–834.

SAC-2010-CaoWWH #approach #composition #named #network #social

OASNET: an optimal allocation approach to influence maximization in modular social networks (TC, XW, SW, XH), pp. 1088–1094.

SAC-2010-ShieTY #data type #mining #online

Online mining of temporal maximal utility itemsets from data streams (BES, VST, PSY), pp. 1622–1626.

LICS-2010-AvronAZ #logic #on the

On Strong Maximality of Paraconsistent Finite-Valued Logics (AA, OA, AZ), pp. 304–313.

CASE-2009-KumarWKSS #analysis #fuzzy #predict #using #variability

A fuzzy filtering based system for maximal oxygen uptake prediction using heart rate variability analysis (MK, MW, SK, NS, RS), pp. 604–608.

CASE-2009-WangLNRKML #concurrent #parallel #source code #thread

Maximally permissive deadlock avoidance for multithreaded computer programs (Extended abstract) (YW, HL, AN, SAR, TK, SAM, SL), pp. 37–41.

VLDB-2009-WongOYFL #nearest neighbour #performance

Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor (RCWW, MTÖ, PSY, AWCF, LL), pp. 1126–1137.

STOC-2009-GhoshRS #privacy

Universally utility-maximizing privacy mechanisms (AG, TR, MS), pp. 351–360.

STOC-2009-LeeMNS #constraints

Non-monotone submodular maximization under matroid and knapsack constraints (JL, VSM, VN, MS), pp. 323–332.

CIKM-2009-KurasawaFTA #clustering #metric #similarity

Maximal metric margin partitioning for similarity search indexes (HK, DF, AT, JA), pp. 1887–1890.

ICML-2009-VolkovsZ #learning #named #ranking

BoltzRank: learning to maximize expected ranking gain (MV, RSZ), pp. 1089–1096.

KDD-2009-ChenWY #network #performance #social

Efficient influence maximization in social networks (WC, YW, SY), pp. 199–208.

LDTA-2008-Dolstra09 #domain-specific language #functional #lazy evaluation #performance

Maximal Laziness: An Efficient Interpretation Technique for Purely Functional DSLs (ED), pp. 81–99.

CC-2009-Abu-MahmeedMBKRHARK #scheduling

Scheduling Tasks to Maximize Usage of Aggregate Variables in Place (SAM, CM, ZB, KK, KR, KH, PA, SR, JK), pp. 204–219.

DAC-2008-LiuCJHZDH

Topological routing to maximize routability for package substrate (SL, GC, TTJ, LH, TZ, RD, XH), pp. 566–569.

HT-2008-Diniz #education #hypermedia #using

Efl and hypertext: using webquests to maximize english teaching (MGD), pp. 223–224.

ICEIS-ISAS2-2008-AlencarSAFF #approach #bound #branch

Maximizing the Business Value of Software Projects — A Branch & Bound Approach (AJA, EAS, EPdA, MCF, ALF), pp. 162–169.

ICEIS-ISAS2-2008-FernandesAS #performance #programming #release planning

An Extreme Programming Release Plan that Maximizes Business Performance (MCF, AJA, EAS), pp. 12–22.

CIKM-2008-ModaniD #clique #graph #scalability

Large maximal cliques enumeration in sparse graphs (NM, KD), pp. 1377–1378.

CIKM-2008-WangCZL #constraints #learning #metric

Semi-supervised metric learning by maximizing constraint margin (FW, SC, CZ, TL), pp. 1457–1458.

ICML-2008-LuPV #analysis #component #multi

Uncorrelated multilinear principal component analysis through successive variance maximization (HL, KNP, ANV), pp. 616–623.

ICML-2008-SiggB

Expectation-maximization for sparse and non-negative PCA (CDS, JMB), pp. 960–967.

RTA-2008-FuhsGMSTZ #termination

Maximal Termination (CF, JG, AM, PSK, RT, HZ), pp. 110–125.

DAC-2007-CollinsC #optimisation #throughput

Topology-Based Optimization of Maximal Sustainable Throughput in a Latency-Insensitive System (RLC, LPC), pp. 410–415.

DATE-2007-GaneshpureK #automation #fault #generative #interactive #multi

Interactive presentation: Automatic test pattern generation for maximal circuit noise in multiple aggressor crosstalk faults (KPG, SK), pp. 540–545.

DATE-2007-HuVKCP #dependence #estimation #memory management #performance

Fast memory footprint estimation based on maximal dependency vector calculation (QH, AV, PGK, FC, MP), pp. 379–384.

PODS-2007-KimelfeldS #probability

Maximally joining probabilistic data (BK, YS), pp. 303–312.

DLT-2007-BealBR #ambiguity

Coding Partitions: Regularity, Maximality and Global Ambiguity (MPB, FB, AR), pp. 48–59.

ICALP-2007-BodirskyCKO #constraints

Maximal Infinite-Valued Constraint Languages (MB, HC, JK, TvO), pp. 546–557.

HCI-IDU-2007-Rintel

Maximizing Environmental Validity: Remote Recording of Desktop Videoconferencing (ESR), pp. 911–920.

ICML-2007-SongSGB #clustering #dependence

A dependence maximization view of clustering (LS, AJS, AG, KMB), pp. 815–822.

MLDM-2007-AoYHH #data type #mining

Mining Maximal Frequent Itemsets in Data Streams Based on FP-Tree (FA, YY, JH, KH), pp. 479–489.

SAC-2007-LianCY #database #maintenance #scalability

Maintenance of maximal frequent itemsets in large databases (WL, DWC, SMY), pp. 388–392.

CASE-2006-ShrinivasR

Optimal advertisement-innovation mix for maximizing the discounted flow of profit (PS, NRSR), pp. 562–567.

STOC-2006-Feige #on the

On maximizing welfare when utility functions are subadditive (UF), pp. 41–50.

DLT-2006-Lakshmanan

End-Marked Maximal Depth-First Contextual Grammars (LK), pp. 339–350.

ICALP-v2-2006-ArmknechtK #algebra #multi

Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity (FA, MK), pp. 180–191.

CIKM-2006-StanoiMPL #distributed #query #throughput

Maximizing the sustained throughput of distributed continuous queries (IS, GAM, TP, CAL), pp. 834–835.

ICML-2006-WarmuthLR #algorithm

Totally corrective boosting algorithms that maximize the margin (MKW, JL, GR), pp. 1001–1008.

ICPR-v1-2006-ArandjelovicC #classification #set #using

Face Set Classification using Maximally Probable Mutual Modes (OA, RC), pp. 511–514.

ICPR-v1-2006-DijckH #detection

Onset Detection through Maximal Redundancy Detection (GVD, MMVH), pp. 945–949.

ICPR-v1-2006-DonoserB #3d #segmentation

3D Segmentation by Maximally Stable Volumes (MSVs) (MD, HB), pp. 63–66.

KDD-2006-KnobbeH #performance

Maximally informative k-itemsets and their efficient discovery (AJK, EKYH), pp. 237–244.

SAC-2006-RothF #information management #recommendation

Trust-decisions on the base of maximal information of recommended direct-trust (UR, VF), pp. 1898–1901.

DAC-2005-CortesEP #energy #realtime

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

VLDB-2005-GodfreySG #scalability #set

Maximal Vector Computation in Large Data Sets (PG, RS, JG), pp. 229–240.

CIKM-2005-Ahonen-Myka #mining #sequence #set #word

Mining all maximal frequent word sequences in a set of sentences (HAM), pp. 255–256.

CIKM-2005-PossasZRM #query

Maximal termsets as a query structuring mechanism (BP, NZ, BARN, WMJ), pp. 287–288.

ICML-2005-SalojarviPK #algorithm

Expectation maximization algorithms for conditional likelihoods (JS, KP, SK), pp. 752–759.

KDD-2005-HeerenP

Maximal boasting (CH, LP), pp. 580–585.

DATE-v1-2004-HandaV #algorithm #performance

A Fast Algorithm for Finding Maximal Empty Rectangles for Dynamic FPGA Placement (MH, RV), pp. 744–745.

DLT-2004-IbarraYD #parallel #power of

The Power of Maximal Parallelism in P Systems (OHI, HCY, ZD), pp. 212–224.

CIKM-2004-SiC #framework

Unified utility maximization framework for resource selection (LS, JPC), pp. 32–41.

ICML-2004-GrossmanD #classification #learning #network

Learning Bayesian network classifiers by maximizing conditional likelihood (DG, PMD).

ICML-2004-ZhangKY #algorithm

Surrogate maximization/minimization algorithms for AdaBoost and the logistic regression model (ZZ, JTK, DYY).

ICPR-v1-2004-GocciaSD #classification #fuzzy #learning #recognition

Learning Optimal Classifier Through Fuzzy Recognition Rate Maximization (MG, CS, SGD), pp. 204–207.

ICPR-v2-2004-ErikssonC #2d #analysis

Maximizing Validity in 2D Motion Analysis (ME, SC), pp. 179–183.

ICPR-v2-2004-IkedaIA #optimisation

Sensor Fusion as Optimization: Maximizing Mutual Information between Sensory Signals (TI, HI, MA), pp. 501–504.

ICPR-v3-2004-GimelfarbFE #linear

Expectation-Maximization for a Linear Combination of Gaussians (GLG, AAF, AEB), pp. 422–425.

ICPR-v4-2004-Cheung #algorithm #automation #clustering #towards

A Rival Penalized EM Algorithm towards Maximizing Weighted Likelihood for Density Mixture Clustering with Automatic Model Selection (YmC), pp. 633–636.

KDD-2004-HuanWPY #database #graph #mining #named

SPIN: mining maximal frequent subgraphs from graph databases (JH, WW, JP, JY), pp. 581–586.

KDD-2004-Yang #complexity #mining

The complexity of mining maximal frequent itemsets and maximal frequent patterns (GY), pp. 344–353.

KDD-2004-YanVS #predict

Predicting prostate cancer recurrence via maximizing the concordance index (LY, DV, OS), pp. 479–485.

ICDAR-2003-Breuel #algorithm #analysis #documentation #layout

An Algorithm for Finding Maximal Whitespace Rectangles at Arbitrary Orientations for Document Layout Analysis (TMB), pp. 66–70.

VLDB-2003-ViglasNB #multi #query #streaming

Maximizing the Output Rate of Multi-Way Join Queries over Streaming Information Sources (SV, JFN, JB), pp. 285–296.

ICEIS-v2-2003-SrikumarB #algorithm #mining #set #transaction

An Algorithm for Mining Maximal Frequent Sets Based on Dominancy of Transactions (KS, BB), pp. 422–425.

KDD-2003-KempeKT #network #social

Maximizing the spread of influence through a social network (DK, JMK, ÉT), pp. 137–146.

KDD-2003-SripadaRHY #generative #summary #using

Generating English summaries of time series data using the Gricean maxims (SS, ER, JH, JY), pp. 187–196.

SIGIR-2003-GaoWLC #approach #categorisation #learning

A maximal figure-of-merit learning approach to text categorization (SG, WW, CHL, TSC), pp. 174–181.

SAC-2003-Lin #mining

Mining Maximal Frequent Intervals (JLL), pp. 426–431.

DATE-2002-Hsiao #fault #identification

Maximizing Impossibilities for Untestable Fault Identification (MSH), pp. 949–953.

DATE-2002-PenalbaMH #reuse

Maximizing Conditonal Reuse by Pre-Synthesis Transformations (OP, JMM, RH), p. 1097.

IFM-2002-JeskeB

Minimally and Maximally Abstract Retrenchments (CJ, RB), pp. 380–400.

SIGIR-2002-CarmelFPS #automation #information management #query #refinement #using

Automatic query refinement using lexical affinities with maximal information gain (DC, EF, YP, AS), pp. 283–290.

SIGIR-2002-SlonimFT #classification #documentation #using

Unsupervised document classification using sequential information maximization (NS, NF, NT), pp. 129–136.

WCRE-2001-Rilling #comprehension #functional

Maximizing Functional Cohesion of Comprehension Environments by Integrating User and Task Knowledge (JR), pp. 157–165.

WCRE-2001-SartipiK #clustering #component

Component Clustering Based on Maximal Association (KS, KK), pp. 103–114.

STOC-2001-BulatovKJ #complexity #constraints

The complexity of maximal constraint languages (AAB, AAK, PJ), pp. 667–674.

ICML-2001-IvanovBP

Expectation Maximization for Weakly Labeled Data (YAI, BB, AP), pp. 218–225.

ICML-2001-SchefferW #incremental #information management #problem

Incremental Maximization of Non-Instance-Averaging Utility Functions with Applications to Knowledge Discovery Problems (TS, SW), pp. 481–488.

STOC-2000-BermanD #realtime #scheduling

Improvements in throughout maximization for real-time scheduling (PB, BD), pp. 680–687.

ICML-2000-GoldbergM #learning #modelling #multi

Learning Multiple Models for Reward Maximization (DG, MJM), pp. 319–326.

ICPR-v1-2000-LerasleDL #clique

Relaxation vs. Maximal Cliques Search for Projected Beams Labeling in a Structured Light Sensor (FL, MD, JML), pp. 1782–1785.

SAC-2000-AlhajjP

Maximizing Reuseability: Seeking Appropriate Positions for Derived Classes Within the Class Hierarchy (RA, FP), pp. 351–355.

DAC-1999-LiuPF #performance #scheduling

Maximizing Performance by Retiming and Clock Skew Scheduling (XL, MCP, EGF), pp. 231–236.

HCI-CCAD-1999-Wirth #case study #monitoring #network #visualisation

Maximizing data density: a case study of visualization in network monitoring (JW), pp. 127–131.

OSDI-1999-GamsaKAS #concurrent #locality #memory management #multi #named #operating system

Tornado: Maximizing Locality and Concurrency in a Shared Memory Multiprocessor Operating System (BG, OK, JA, MS), pp. 87–100.

ICPR-1998-NakamuraEIH #algorithm #using

Skeleton revision algorithm using maximal circles (TN, HE, HI, LH), pp. 1607–1609.

POPL-1998-BarthouCC

Maximal Static Expansion (DB, AC, JFC), pp. 98–106.

SAC-1998-Kimm #2d #configuration management #pipes and filters #problem

Two dimensional maximal elements problem on a reconfigurable optical pipelined bus system (HK), pp. 623–627.

EDTC-1997-ManichF #process

Maximizing the weighted switching activity in combinational CMOS circuits under the variable delay model (SM, JF), pp. 597–602.

STOC-1997-AwerbuchS #algorithm #multi #online

Online Algorithms for Selective Multicast and Maximal Dense Trees (BA, TS), pp. 354–362.

STOC-1997-KhannaSW #classification #constraints #problem

A Complete Classification of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction (SK, MS, DPW), pp. 11–20.

KDD-1997-FeldmanAAZK #documentation #keyword #mining

Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections (RF, YA, AA, AZ, WK), pp. 167–170.

POPL-1997-LimL #parallel

Maximizing Parallelism and Minimizing Synchronization with Affine Transforms (AWL, MSL), pp. 201–214.

ICALP-1996-BruyereL

Variable-Length Maximal Codes (VB, ML), pp. 24–47.

ICPR-1996-LohmannK #image

Extracting lines of maximal depth from MR images of the human brain (GL, FK), pp. 518–522.

ICPR-1996-RaudysD #classification #empirical #fault

Expected error of minimum empirical error and maximal margin classifiers (SR, VD), pp. 875–879.

KDD-1996-MasandP #comparison #modelling #predict

A Comparison of Approaches for Maximizing Business Payoff of Prediction Models (BMM, GPS), pp. 195–201.

JICSLP-1996-LeuschelSW #concept #deduction #integration #towards

A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration (ML, DDS, DAdW), pp. 319–332.

ICALP-1995-Chen #algorithm #set #string

NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings (ZZC), pp. 99–110.

DAC-1994-ZhuW #bound

Switch Bound Allocation for Maximizing Routability in Timing-Driven Routing of FPGAs (KZ, DFW), pp. 165–170.

EDAC-1994-HuangR #behaviour #performance #throughput #using

Maximizing the Throughput of High Performance DSP Applications Using Behavioral Transformations (SHH, JMR), pp. 25–30.

VLDB-1994-NgY #on-demand

Maximizing Buffer and Disk Utilizations for News On-Demand (RTN, JY), pp. 451–462.

ICML-1993-Schwartz #learning

A Reinforcement Learning Method for Maximizing Undiscounted Rewards (AS), pp. 298–305.

STOC-1992-Kelsen #complexity #independence #on the #parallel #set

On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph (PK), pp. 339–350.

ICALP-1991-Loebl #graph #performance #polynomial

Efficient Maximal Cubic Graph Cuts (Extended Abstract) (ML), pp. 351–362.

CHI-1991-SiochiH #analysis #case study #evaluation #user interface #using

A study of computer-supported user interface evaluation using maximal repeating pattern analysis (ACS, DH), pp. 301–305.

ML-1990-ArunkumarY #information management #learning #representation #using

Knowledge Acquisition from Examples using Maximal Representation Learning (SA, SY), pp. 2–8.

ICALP-1988-Niemi

Maximal Dense Intervals of Grammar Forms (VN), pp. 424–438.

ICALP-1987-Miyano #algorithm #problem

The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC Algorithms (SM), pp. 425–434.

LICS-1987-Milner #fixpoint

Some Uses of Maximal Fixed Points (Abstract of Invited Lecture) (RM), p. 3.

PODS-1986-OlkenR #performance

Rearranging Data to Maximize the Efficiency of Compression (FO, DR), pp. 78–90.

STOC-1985-Anderson #algorithm #parallel #problem

A Parallel Algorithm for the Maximal Path Problem (RA), pp. 33–37.

STOC-1985-Luby #algorithm #independence #parallel #problem #set

A Simple Parallel Algorithm for the Maximal Independent Set Problem (ML), pp. 1–10.

ICALP-1985-OrponenRS #complexity #polynomial

Polynomial Levelability and Maximal Complexity Cores (PO, DAR, US), pp. 435–444.

PODS-1984-LausenSW #concurrent

Maximal Concurrency by Locking (GL, ESS, PW), pp. 38–44.

STOC-1984-KarpW #algorithm #independence #parallel #performance #problem #set

A Fast Parallel Algorithm for the Maximal Independent Set Problem (RMK, AW), pp. 266–272.

DAC-1981-Abramovici #algorithm #testing

A maximal resolution guided-probe testing algorithm (MA), pp. 189–195.

STOC-1978-Lueker #graph #problem

Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution (Extended Abstract) (GSL), pp. 13–18.

DAC-1976-GoundanH #clustering #fault #logic

Partitioning logic circuits to maximize fault resolution (AG, JPH), pp. 271–277.

ICSE-1976-Wexelblat #design #how #programming

Maxims for Malfeasant Designers, or How to Design Languages to Make Programming as Difficult as Possible (RLW), pp. 331–336.

ICALP-1974-Schnorr #information management #on the

On Maximal Merging of Information in Boolean Computations (CPS), pp. 294–300.