Results 21  30
of
1,316
Improving the DivideandConquer Approach to SumofPairs Multiple Sequence Alignment
, 1996
"... We consider the problem of multiple sequence alignment: given k sequences of length at most n and a certain scoring function, find an alignment that minimizes the corresponding "sum of pairs" distance score. We generalize the divideandconquer technique described in [7] and [21], and ..."
Abstract
 Add to MetaCart
We consider the problem of multiple sequence alignment: given k sequences of length at most n and a certain scoring function, find an alignment that minimizes the corresponding "sum of pairs" distance score. We generalize the divideandconquer technique described in [7] and [21
Divideandconquer approach for the exemplar breakpoint distance
 Bioinformatics
, 2005
"... Motivation: A onetoone correspondence between the sets of genes in the two genomes being compared is necessary to the notions of breakpoint and reversal distances. To compare genomes where there are paralogous genes, Sankoff formulated the exemplar distance problem as a general version of the g ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
of the genome rearrangement problem. Unfortunately, the problem is NPhard even for the breakpoint distance. Results: This paper proposes a divideandconquer approach for calculating the exemplar breakpoint distance between two genomes with multiple gene families. The combination of our approach and Sankoff’s
Decomposed Process Mining with DivideAndConquer
"... Abstract. Many known process mining techniques scale badly in the number of activities in an event log. Examples of such techniques include the ILP Miner and the standard replay, which also uses ILP techniques. To alleviate the problems these techniques face, we can decompose a large problem (with m ..."
Abstract
 Add to MetaCart
many activities) into a number of small problems (with few activities). Expectation is, that the run times of such a decomposed setting will be faster than the run time of the original setting. This paper presents the DivideAndConquer tool, which allows the user to decompose a large problem into small
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
into a Petri net, but unfortunately the transformation requires algorithms with high complexity. This paper provides techniques to overcome this limitation. Either by using decomposition techniques, or by clustering events in the log and working on projections, the proposed approach can be used to widen
A DivideandConquer Approach to Quad Remeshing
"... Abstract—Many natural and manmade objects consist of simple primitives, similar components, and various symmetry structures. This paper presents a divideandconquer quadrangulation approach that exploits such global structural information. Given a model represented in triangular mesh, we first seg ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract—Many natural and manmade objects consist of simple primitives, similar components, and various symmetry structures. This paper presents a divideandconquer quadrangulation approach that exploits such global structural information. Given a model represented in triangular mesh, we first
Iteration Schemes for the DivideandConquer Eigenvalue Solver
, 1994
"... this paper we improve the results of [3] by proposing different techniques for both of the stages of the algorithm. Concerning the first stage we compute the intervals by applying Sturm sequences, thus reducing the cost bound by a multiplicative factor. Concerning the second stage we introduce and a ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
this paper we improve the results of [3] by proposing different techniques for both of the stages of the algorithm. Concerning the first stage we compute the intervals by applying Sturm sequences, thus reducing the cost bound by a multiplicative factor. Concerning the second stage we introduce
unknown title
"... A general divideandconquer technique can be described in three steps: the input is recursively split into k tiles while the tile size exceeds a fixed size M, individual tiles are sorted independently and merged into the final sorted sequence. Most divideandconquer algorithms are based either on ..."
Abstract
 Add to MetaCart
A general divideandconquer technique can be described in three steps: the input is recursively split into k tiles while the tile size exceeds a fixed size M, individual tiles are sorted independently and merged into the final sorted sequence. Most divideandconquer algorithms are based either
A problem in multivariate statistics: Algorithm, data structure, and applications
 In Proceedings of the Fifteenth Allerton Conference on Communication, Control, and Computing
, 1977
"... We investigate problems and applications associated with computing the empirical cumulative distribution function of. N points in k dimensional space · and employ a multidimensional divideandconquer technique that gives rise to a compact data structure for geometric and statistical s·earch. proble ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
We investigate problems and applications associated with computing the empirical cumulative distribution function of. N points in k dimensional space · and employ a multidimensional divideandconquer technique that gives rise to a compact data structure for geometric and statistical s
Locality helps sleep scheduling
 In: Working Notes of the Workshop on WorldSensorWeb: Mobile DeviceCentric Sensory Networks and Applications (2006), http://www.sensorplanet.org/wsw2006/8_Suomela_WSW2006_final.pdf
"... This work studies sleep scheduling in mobiledevice centric sensor networks. The objective is to maximise the lifetime by exploiting redundancy in an overdeployed network. Redundancy is described by a redundancy graph; it turns out that typical realistic redundancy graphs are members of the family ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
of local graphs. By using a divideandconquer technique based on modular grids, it is shown that sleep scheduling admits a polynomialtime approximation scheme in local graphs; this is not the case in arbitrary graphs. 1.
On improving the accuracy of Horner’s and Goertzel’s algorithms
, 2004
"... It is known that Goertzel’s algorithm is much less numerically accurate than the Fast Fourier Transform (FFT)(Cf. [2]). In order to improve accuracy we propose modifications of both Goertzel’s and Horner’s algorithms based on the divideandconquer techniques. The proof of the numerical stability of ..."
Abstract
 Add to MetaCart
It is known that Goertzel’s algorithm is much less numerically accurate than the Fast Fourier Transform (FFT)(Cf. [2]). In order to improve accuracy we propose modifications of both Goertzel’s and Horner’s algorithms based on the divideandconquer techniques. The proof of the numerical stability
Results 21  30
of
1,316