JDCTA
2010
12 years 12 months ago
2010
Text clustering is one of the difficult and hot research fields in the text mining research. Combing Map Reduce framework and the neuron initialization method of VPSOM (vector pre...
JDCTA
2010
12 years 12 months ago
2010
Encoding can express the hierarchical relationship in the area of mining the multi-level sequential pattern, up to now all the algorithms of which find frequent sequences just acc...
JDCTA
2010
12 years 12 months ago
2010
Straight line is the most basic element of graphics, and it is of great significance to study fast algorithm of line generating. On the basis of Bresenham algorithm, this paper co...
JDCTA
2010
12 years 12 months ago
2010
To quickly get the median value of any given sequence is very important in many research fields. Some popular sort algorithms are discussed in this paper. Selection sort algorithm...
JCIT
2010
12 years 12 months ago
2010
In this paper a novel adaptive load balancing routing algorithm in Ad hoc networks based on a gossiping mechanism is proposed. Unlike previously published algorithms, this algorit...
JCIT
2010
12 years 12 months ago
2010
s In grid computing, the goals of task scheduling is to achieve high system optimization performance while matching multi-dimension Quiality of Service(QoS) requirement of applicat...
JCIT
2010
12 years 12 months ago
2010
For stationary or quasi-stationary frames of a video sequence, traditional block matching algorithms (BMA) will easily lead the search to be trapped into a local minimum. In this ...
JAIR
2010
12 years 12 months ago
2010
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, i...
ITIIS
2010
12 years 12 months ago
2010
Rapid growth of internet applications has increased the importance of intrusion detection system (IDS) performance. String matching is the most computation-consuming task in IDS. ...
IPL
2010
12 years 12 months ago
2010
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...