We present a divide-and-conquer algorithm for parsing context-free languages efficiently. Our algorithm is an instance of Valiant’s (1975), who reduced the problem of parsing to matrix multiplications. We show that, while the conquer step of Valiant’s is O(n), it improves to O(log n) under certain conditions satisfied by many useful inputs, and if one uses a sparse representation of matrices. T...

In a world where data is captured on a large scale the major challenge for data mining algorithms is to be able to scale up to large datasets. There are two main approaches to inducing classification rules, one is the divide and conquer approach, also known as the top down induction of decision trees; the other approach is called the separate and conquer approach. A considerable amount of work ...

Recent work introduced the cube-and-conquer technique to solve hard SAT instances. It partitions the search space into cubes using a lookahead solver. Each cube is tackled by a conflict-driven clause learning (CDCL) solver. Crucial for strong performance is the cutoff heuristic that decides when to switch from lookahead to CDCL. Yet, this offline heuristic is far from ideal. In this paper, we p...

Divide and conquer is an established algorithm design paradigm that has proven itself to solve a variety of problems efficiently. However, it yet be fully explored in solving with neural network, particularly the problem image super-resolution. In this work, we propose approach divide super-resolution into multiple subproblems then solve/conquer them help network. Unlike typical deep alternate ...

In this report the conceptual query language ConQuer-92 is introduced. This query language serves as the backbone of InfoAssistant's query facilities. Furthermore , this language can also be used for the specification of derivation rules (e.g. subtype defining rules) and textual constraints in InfoModeler. This report is solely concerned with a formal definition, and the explanation thereof, of...