Results 11  20
of
1,408
Exact Asymptotics of DivideandConquer Recurrences
"... The divideandconquer principle is a major paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used in the algorithm. This work shows that periodicity phenomena, often of a fractal nature, are ubiquitous in the performanc ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
The divideandconquer principle is a major paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used in the algorithm. This work shows that periodicity phenomena, often of a fractal nature, are ubiquitous
DivideandConquer Approximation Algorithms via Spreading Metrics
, 1996
"... We present a novel divideandconquer paradigm for approximating NPhard graph optimization problems. The paradigm models graph optimization problems that satisfy two properties: First, a divideandconquer approach is applicable. Second, a fractional spreading metric is computable in polynomial tim ..."
Abstract

Cited by 110 (9 self)
 Add to MetaCart
We present a novel divideandconquer paradigm for approximating NPhard graph optimization problems. The paradigm models graph optimization problems that satisfy two properties: First, a divideandconquer approach is applicable. Second, a fractional spreading metric is computable in polynomial
Bicbased Audio Segmentation by DivideandConquer
 in Proc. ICASSP
, 2008
"... Audio segmentation has received increasing attention in recent years for its potential applications in automatic indexing and transcription of audio data. Among existing audio segmentation approaches, the BICbased approach proposed by Chen and Gopalakrishnan is most wellknown for its high accuracy ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
accuracy. However, this windowgrowingbased segmentation approach suffers from the high computation cost. In this paper, we propose using the efficient divideandconquer strategy in audio segmentation. Our approaches detect acoustic changes by recursively partitioning an analysis window into two sub
Efficient DivideandConquer Implementations Of Symmetric FSAs
, 2008
"... A deterministic finitestate automaton (FSA) is an abstract sequential machine that reads the symbols comprising an input word one at a time. An FSA is symmetric if its output is independent of the order in which the input symbols are read, i.e., if the output is invariant under permutations of the ..."
Abstract
 Add to MetaCart
of the input. We show how to convert a symmetric FSA A into an automatonlike divideandconquer process whose intermediate results are no larger than the size of A’s memory. In comparison, a similar result for general FSA’s has been long known via functional composition, but entails an exponential increase
DivideandConquer Strategies for Process Mining
"... Abstract. The goal of Process Mining is to extract process models from logs of a system. Among the possible models to represent a process, Petri nets is an ideal candidate due to its graphical representation, clear semantics and expressive power. The theory of regions can be used to transform a log ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
the applicability of classical regionbased techniques. 1
Speaker Diarization Using DivideandConquer
"... Speaker diarization systems usually consist of two core components: speaker segmentation and speaker clustering. The current stateoftheart speaker diarization systems usually apply hierarchical agglomerative clustering (HAC) for speaker clustering after segmentation. However, HAC’s quadratic comp ..."
Abstract
 Add to MetaCart
computational complexity with respect to the number of data samples inevitably limits its application in largescale data sets. In this paper, we propose a divideandconquer (DAC) framework for speaker diarization. It recursively partitions the input speech stream into two substreams, performs diarization
Efficient DivideandConquer Simulations Of Symmetric FSAs
, 2008
"... A finitestate automaton (FSA) is an abstract machine with finite working memory, whose input is a string from a finite alphabet, which reads the input one character at a time, and which has a deterministic transition function. An FSA is symmetric if its output is independent of the order in which t ..."
Abstract
 Add to MetaCart
necessarily symmetric) FSA, a similar divideandconquer implementation has long been known via functional composition but entails an exponential increase in the size of the state space. Our result has applications to parallel processing and to symmetric FSA networks. The first step in the construction
Scheduling of Dynamic DivideandConquer Computations on Multicomputers
"... The scheduling of tasks for applications with dynamic behavior traditionally rely on externally observable metrics such as the number of active processes. This paper presents a new scheduling strategy based on the observation that it may be possible to capture the nearterm resource requirements of ..."
Abstract
 Add to MetaCart
the source program with such expressions. Preliminary simulation results show that the use of nearfuture estimates in a dynamic scheduling strategy for divideandconquer algorithms consistently improves over traditional dynamic strategies. The performance of this strategy approaches that of the best
DivideandConquer Methods for Solving MDPs
"... The Markov Decision Process (MDP) is the principal theoretical formalism in the area of Reinforcement Learning (RL). An import from optimal control in operations research, this construct is generic enough to represent problems comprising almost all of AI research, but consequently, it suffers from t ..."
Abstract
 Add to MetaCart
of the classic divideandconquer approach to problemsolving in computer science – breaking up a large, unwieldy problem into smaller components and solving the parts. This paper reviews most of the methods proposed in the associated literature, weighing their pros and cons, and their applicability
Synthesizing DivideandConquer Algorithms via Induction
"... ) Abstract We propose an inductive method to synthesize parallel divideandconquer programs from sequential recursive functions. Traditionally, such parallelization methods are based on schematic rules which attempt to match each given sequential program to a prescribed set of program schemes ..."
Abstract
 Add to MetaCart
) Abstract We propose an inductive method to synthesize parallel divideandconquer programs from sequential recursive functions. Traditionally, such parallelization methods are based on schematic rules which attempt to match each given sequential program to a prescribed set of program schemes
Results 11  20
of
1,408