نتایج جستجو برای: merging and splitting scheme

تعداد نتایج: 16858835  

2012
Zhongmin Xiong Eric Robert Mark J Kushner

Atmospheric-pressure fast ionization waves (FIWs) generated by nanosecond, high voltage pulses are able to propagate long distances through small diameter dielectric tubes or channels, and so deliver UV fluxes, electric fields, charged and excited species to remote locations. In this paper, the dynamics of FIW splitting and merging in a branched dielectric channel are numerically investigated u...

2002
Chris H. Q. Ding Xiaofeng He

Hierarchical clustering constructs a hierarchy of clusters by either repeatedly merging two smaller clusters into a larger one or splitting a larger cluster into smaller ones. The crucial step is how to best select the next cluster(s) to split or merge. Here we provide a comprehensive analysis of selection methods and propose several new methods. We perform extensive clustering experiments to t...

2017
Moritz Flöter Pascal Reuss Johannes Ude Klaus-Dieter Althoff

In Case-Based Reasoning (CBR), taxonomies are often used to model similarities. For complex domains and tasks such taxonomies tend to increase in size making them hard to model and maintain. This especially holds true if a group of people is working on the same taxonomy simultaneously. In this paper, we propose a solution by dividing larger taxonomies into sub-taxonomies, which can be regarded ...

2010
Milad Niqui Jan J. M. M. Rutten

We study various operations for partitioning, projecting and merging streams of data. These operations are motivated by their use in dataflow programming and the stream processing languages. We use the framework of stream calculus and stream circuits for defining and proving properties of such operations using behavioural differential equations and coinduction proof principles. We study the inv...

Journal: :Inf. Comput. 1999
Roberto Grossi Giuseppe F. Italiano

Let S be a set whose items are sorted with respect to d > 1 total orders 1 ; : : : ; d , and which is subject to dynamic operations, such as insertions of a single item, deletions of a single item, split and concatenate operations performed according to any chosen order i (1 i d). This generalizes to dimension d > 1 the notion of concatenable data structures, such as the 2-3-trees, which suppor...

2016
J. Senthilnath Nitin Karnwal

This paper presents a hierarchical clustering algorithm for crop type classification problem using multi-spectral satellite image. In unsupervised techniques, the automatic generation of clusters and its centers is not exploited to their full potential. Hence, a hierarchical clustering algorithm is proposed which uses splitting and merging techniques. Initially, the splitting method is used to ...

Journal: :IACR Cryptology ePrint Archive 2009
Anupam Pattanayak B. Majhi

Transversal Design is a well known combinatorial design that has been used in deterministic key predistribution scheme. Merging of blocks in a design sometimes helps to obtain a key predistribution scheme with better performance. A deterministic merging strategy to merge the blocks has been discussed. Also, a simple key establishment method for transversal design based key predistribution schem...

2009
George Zhu

Light detection and ranging (LIDAR) instruments collect high density and accurate 3D point clouds of scanned surfaces of objects. For the applications of building reconstruction from ground based LIDAR, the most fundamental spatial information to be extracted are plane features. ZE Modeller implements a point cloud registration and geo-referencing alogithm. Further, ZE Modeller also offers an a...

2004
Herve Moulin

If shortest jobs are served first, splitting a long job into smaller jobs reported under different aliases, will reduce the actual wait until completion. If longest jobs are served first, the dual maneuver of merging several jobs under a single reported identity is profitable. Both manipulations can be avoided if the scheduling order is random, and users care only about the expected wait until ...

2000
Sonia Jain Radford M. Neal

We propose a split-merge Markov chain algorithm to address the problem of inee-cient sampling for conjugate Dirichlet process mixture models. Traditional Markov chain Monte Carlo methods for Bayesian mixture models, such as Gibbs sampling, can become trapped in isolated modes corresponding to an inappropriate clustering of data points. This article describes a Metropolis-Hastings procedure that...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید