Stem conquer$ (all stems)

39 papers:

SIGMOD-2015-ZhangYQS #performance

Divide & Conquer: I/O Efficient Depth-First Search (ZZ, JXY, LQ, ZS), pp. 445–458.

VLDB-2015-PapenbrockKQN #dependence

Divide & Conquer-based Inclusion Dependency Discovery (TP, SK, JAQR, FN), pp. 774–785.

ICALP-v1-2015-GaspersS #algorithm #performance #set

Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (SG, GBS), pp. 567–579.

ICML-2015-YangX15b #clustering #distributed #divide and conquer #framework #graph

A Divide and Conquer Framework for Distributed Graph Clustering (WY, HX), pp. 504–513.

SAC-2015-SantosOCFTT #named #similarity

Combine-and-conquer: improving the diversity in similarity search through influence sampling (LFDS, WDO, LOC, MRPF, AJMT, CTJ), pp. 994–999.

CASE-2014-ZhaoUH #divide and conquer #flexibility #synthesis

A divide-and-conquer method for the synthesis of non-blocking supervisors for flexible manufacturing systems (MZ, MU, YH), pp. 455–460.

ICML-c1-2014-HsiehSD #divide and conquer #kernel

A Divide-and-Conquer Solver for Kernel Support Vector Machines (CJH, SS, ISD), pp. 566–574.

ICSM-2013-Roldan-VegaMHF #code search #named #query #refinement

CONQUER: A Tool for NL-Based Query Refinement and Contextualizing Code Search Results (MRV, GM, EH, JAF), pp. 512–515.

IFM-2013-Song00LD #analysis #divide and conquer #reachability

Improved Reachability Analysis in DTMC via Divide and Conquer (SS, LG, JS, YL, JSD), pp. 162–176.

ICFP-2013-BernardyC #context-free grammar #divide and conquer #parsing #performance

Efficient divide-and-conquer parsing of practical context-free languages (JPB, KC), pp. 111–122.

DATE-2012-AnagnostopoulosBKS #distributed #divide and conquer #manycore #runtime

A divide and conquer based distributed run-time mapping methodology for many-core platforms (IA, AB, GK, DS), pp. 111–116.

HILT-2012-Taft #divide and conquer #manycore #named #programming #tutorial #using

Tutorial: multicore programming using divide-and-conquer and work stealing (STT), pp. 13–14.

KDD-2012-Jordan #big data #divide and conquer #statistics

Divide-and-conquer and statistical inference for big data (MIJ), p. 4.

SAT-2012-TakHB #concurrent

Concurrent Cube-and-Conquer — (Poster Presentation) (PvdT, MH, AB), pp. 475–476.

PLDI-2010-SartorBFHM #array #flexibility #named

Z-rays: divide arrays and conquer speed and flexibility (JBS, SMB, DF, MH, KSM), pp. 471–482.

ICSE-2010-ShonleY #composition

Compose & conquer: modularity for end-users (MS, TTY), pp. 191–194.

CIKM-2009-ZhuCWZWC #divide and conquer #learning #query #ranking

To divide and conquer search ranking by learning query difficulty (ZAZ, WC, TW, CZ, GW, ZC), pp. 1883–1886.

POPL-2009-MorihataMHT #divide and conquer #morphism #theorem

The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer (AM, KM, ZH, MT), pp. 177–185.

SAC-2008-SeifertWK #algorithm #detection #divide and conquer #interactive #paradigm

Application of divide-and-conquer algorithm paradigm to improve the detection speed of high interaction client honeypots (CS, IW, PK), pp. 1426–1432.

PLDI-2007-MoritaMMHT #automation #divide and conquer #parallel #source code

Automatic inversion generates divide-and-conquer parallel programs (KM, AM, KM, ZH, MT), pp. 146–155.

ICALP-v1-2006-RaviS #algorithm #approximate

Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs (RR, MS), pp. 169–180.

ICALP-2005-FominGK #case study

Measure and Conquer: Domination — A Case Study (FVF, FG, DK), pp. 191–203.

ICPR-v1-2004-VirmajokiF #algorithm #clustering #divide and conquer #graph

Divide-and-Conquer Algorithm for Creating Neighborhood Graph for Clustering (OV, PF), pp. 264–267.

KDD-2003-AliK #clustering #divide and conquer #using #web

Golden Path Analyzer: using divide-and-conquer to cluster Web clickstreams (KA, SPK), pp. 349–358.

SAC-2002-Huang #divide and conquer #parallel #theory and practice

Grid-enabled parallel divide-and-conquer: theory and practice (CHH), pp. 865–869.

CIKM-2001-HergulaH #how #integration #query

How Foreign Function Integration Conquers Heterogeneous Query Processing (KH, TH), pp. 215–222.

PPoPP-2001-NieuwpoortKB #divide and conquer #performance

Efficient load balancing for wide-area divide-and-conquer applications (RvN, TK, HEB), pp. 34–43.

CAV-2001-MoondanosSHK #divide and conquer #equivalence #logic #named #verification

CLEVER: Divide and Conquer Combinational Logic Equivalence VERification with False Negative Elimination (JM, CJHS, ZH, DK), pp. 131–143.

ICML-2000-ChownD #approach #divide and conquer #information management #learning

A Divide and Conquer Approach to Learning from Prior Knowledge (EC, TGD), pp. 143–150.

PPoPP-1999-RuginaR #algorithm #automation #divide and conquer #parallel

Automatic Parallelization of Divide and Conquer Algorithms (RR, MCR), pp. 72–83.

DATE-1998-RuttenBEK #algorithm #divide and conquer #logic #performance

An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization (JWJMR, MRCMB, CAJvE, MAJK), pp. 749–754.

ICALP-1997-Roura #divide and conquer #theorem

An Improved Master Theorem for Divide-and-Conquer Recurrences (SR), pp. 449–459.

PLILP-1997-HerrmannL #parallel

Transformation of Divide & Conquer to Nested Parallel Loops (CAH, CL), pp. 95–109.

PLILP-1996-Gorlatch #divide and conquer #implementation #parallel

Systematic Extraction and Implementation of Divide-and-Conquer Parallelism (SG), pp. 274–288.

ICALP-1993-FlajoletG #divide and conquer

Exact Asymptotics of Divide-and-Conquer Recurrences (PF, MJG), pp. 137–149.

ICML-1993-JordanJ #approach #divide and conquer #learning #statistics

Supervised Learning and Divide-and-Conquer: A Statistical Approach (MIJ, RAJ), pp. 159–166.

STOC-1991-Matousek #approximate #divide and conquer #geometry

Approximations and Optimal Geometric Divide-And-Conquer (JM), pp. 505–511.

LFP-1990-Baker

Unify and Conquer (HGB), pp. 218–226.

STOC-1976-BentleyS #divide and conquer #multi

Divide-and-Conquer in Multidimensional Space (JLB, MIS), pp. 220–230.