the algorithm

The algorithm also kept track of which numerals belonged to which person and whose handwriting was more similar or distinct.

If the algorithm is running on the algorithm's input the length of the polynomial, generally is considered to be a good algorithm.

Therefore, the algorithm of map labeling and the performance is always the foundation question of charting and GIS.

The effectiveness of the algorithm continues to improve with increasing block size at least up to blocks of several million characters.

The growth rate for an algorithm is the rate at which the cost of the algorithm grows as the size of its input grows.

The algorithm has found a good balance between the robustness and imperceptible of the algorithm, and realized the blind detection.

In doing so I gain some momentum and perhaps some insight in how the algorithm should behave on an edge case and a few normal cases.

The algorithm, as the bottom algorithm of the rapid prototyping scanning software system, has been applied to zone the profiled outline.

The name of the algorithm used for signature generation and validation for the current.

This paper presents a new simple quick sorting algorithm and compares the performance of the algorithm with that of quick sorting algorithm.

The algorithm used for fragmentation is called a distribution scheme.

Classification learning is often necessary when the decisions made by the algorithm will be required as input somewhere else.

While it's nice to have lots of options, the point of spaced repetition software is to let the algorithm handle the scheduling.

Algorithm characteristics: the algorithm is characterized by the formation of the current set of T is always a tree.

The algorithm of decision trees is well known due to simpleness and easy to realize in machine learning.

The algorithm works because if a vertex has no successors, it must be the last one in the topological ordering.

The experimental results show the algorithm is simple and easy-to-implement, and is satisfactory in execution time and recognition rate.

There was a memeplex number corresponding to different frog population number which ensured the algorithm to be comparatively stable.

The algorithm is verified to be feasible through an application on the front fuselage of aircraft.

In this paper, classification has been used in the layout parts and needs, the algorithm will be taken different by the parts and needs.

The results show that the algorithm can concurrently take account of safety, performance and fuel economy and is valuable for practical use.

The feasibility and efficiency of the algorithm are verified by the result of applying it to a sample system.

A detailed account of the algorithm process is given and a proof has been presented for the convergence.

However, the traditional "chalk board" form of execution of the algorithm is difficult to demonstrate dynamically out of the teaching.

At the same time, the algorithm can equilibrate the load of every processor. The results of simulation show that the algorithm is effective.

Test shows that the . system is stable and reliable, and simple to operate, optimum parameters of the algorithm can be obtained promptly.

The algorithm consists of a new bit level scheme and a bit splitting technique.

When a command comes through, the controller uses the algorithm to determine how the message should be sent.

The experiments show that the algorithm has a defect that the robot may be into a deadlock because there may be local optimal solution.

Numerical examples show that the algorithm is of higher precision and efficiency whether limit state equation is nonlinear or not.

A special evolution operator and an objective function were used to satisfy the air traffic control timely request in the algorithm.

The algorithm uses all three of the involved versions of the file and attempts to safely produce a merged version.

It's easier to understand this portion of the algorithm if you remember that each state represent a certain stack configuration.

So far, the examples have taken a procedural approach: The algorithm is akin to a loop over the entire document.

Finally, the algorithm is used for the SEA parameters identification of a structure of two L-shaped coupled plate.

The algorithm did not do very much to solve anyone's marriage issues. But it did suggest ways to understand some kinds of markets better.

The algorithm can be used to adjust the filtering results of a traditional algorithm with targets course maneuvering series.

And he would like to see the algorithm used on tweets from a wider span of time.

The new algorithm is applied to the algorithm of manifold learning and analyzed by experiment at the last part of the paper.

For a message digest, the strength of the algorithm is determined by the size of the hash or check sum that the algorithm generates.

Each generation the algorithm migrates some of the individuals from each population to one of the other populations.

The models are intended to be pure expressions of the algorithm , with the best division between design and implementation possible.

Firstly, the algorithm of triangular bilinear interpolation is shown in detail and applied to acquire the profile from TIN.

The algorithm is simulated in many random network models, and is proved that it has better performance than existing heuristics .

Accordingly, the system is the only source of the algorithm testing procedures executable file.

The algorithm can be simplified according to the real motion state of the ship-borne TV reconnaissance system to achieve high precision.

However, because the average customer vector is extremely sparse, the algorithm's performance tends to be closer to O(M N).

Class defines the algorithm used for a cryptographic operation.

The algorithm was applied to the molding process of a truck fender to determine the heating times of the mold and the product.

The algorithm used in the soleplate region was capable of inspecting various complex defects embedded on different texture backgrounds.

Of course, features really can be anything that helps associate a document with a label and can be incorporated into the algorithm.

Experiments prove that the algorithm has a strong robustness to resist wave filtering, JPEG compression and ordinary geometric attack.

The only "serial" part of the algorithm is the calculation of the offsets between the passes.

The algorithm is proven to be generalized arid effective by the result of experiments.

the algorithm is simple and is able to adjust coefficient automatically, and is practical to engineering.

You can add your own hardware or software implementation of an algorithm and map the implementation to the algorithm name of your choice.

Choosing the algorithm that best fits the application is an important part of your task as a programmer.

The algorithm is initialized by a statistical histogram based FCM algorithm, which can speed up the convergence of the algorithm.

The algorithm has been tested on a network data set. The result showed that it had much better performance than traditional Abnet.

The algorithm consists of two parts: a heuristic enclosed contour searching algorithm and a rule based depth fill-in algorithm.

Through computer simulation of a shallow water channel using burst communication data, the effectiveness of the algorithm is demonstrated.

This paper gives the relative theroy proof and the concrete process of the algorithm. Examples show that this algorithm is effective.

With the chaos disturbance, the algorithm can jump out of the local optimization, increasing the ability of getting the optimal solution.

NS2 simulation revealed that the algorithm comes up to a better forwarding performance with higher bandwidth utilization.

Experiment results show that the algorithm can be employed efficiently for the small holes, especially for the holes at lowly-textured area.

By simulation, the algorithm can obtain a switching time of system exactly and can accurately track changes in the system.

The simulation results show that the algorithm is able to track a fast moving signal while suppressing a fixed interference.

The recursive nature of the algorithm will help to illustrate the standard ABI.

Gets the algorithm used for generating message authentication codes ( MACs ) .

The algorithm can be applied to the traffic grooming in both unidirectional and bi-directional rings assuming arbitrary traffic patterns.

Separating the comparison code allows for the algorithm to be written in a more general way.

The algorithm is able to represent a structure using only few traversals of the tree and is inherently fast.

The algorithm can avoid the scheduling-pouring effect. It has been adopted in a distributed system and got a satisfying result.

For H. 264 decoding algorithm of a real-time image, by studying the open source encoder, to realize the optimization of the algorithm.

Finally, through the system simulation and performance testing, demonstrates the algorithm feasible.

The experiment results show that the algorithm performance is related with system load, failure probability, and computation time of tasks.

The algorithm can be used to support the performance specification and the efficient calculation of the integrity monitoring process.

The two parts of the algorithm are independent each other, thereby any existed scan-conversing algorithm can be used in the first part.

The direction of the arrow dictates the association between the items according to the rules that the algorithm discovered.

The result of the simulation shows that the algorithm can generate the FBM image considerably precise.

Q learning algorithm is one of the most popular reinforcement learning algorithms, but the algorithm exist some problems.

Experimental results show that the advantages of the algorithm are especially obvious when source programs contain large number of. . .

To prove the practicability, the algorithm of the shortest path in bus net aims to the least of number of changing.

Finally, the effect of simulation is satisfactory when the algorithm was used for the parameters estimation of reaction dynamics model.

The algorithm is not dependent upon the modulation type of signal, and can be employed to additive arbitrary Gaussian noise.

For a face image, firstly, identified the approximate face region by the algorithm of the face detection.

The experimental results for practical infrared image show that the algorithm can detection the point target with SCR of 1.

At each iteration, GPSO can obtain the inertia weight auto-adapted to help the algorithm overcome precocious shortcoming effectively.

And the result of simulation shows that the algorithm ensures stability of the varied constrained system.

The algorithm should be considered in other countries where skin diseases in children are a priority, particularly in the Pacific region.

Simulation results on a set of benchmark functions show that the algorithm can properly find all the optima .

Furthermore, a forest competition algorithm was proposed. To verify the algorithm, it was applied to solve transcendental equations.

You could always take a step where the algorithm is 95 percent accurate and you let individuals handle the last 5 percent.

The algorithm shows rapid speed and quite good effect as it is applied to a paper mill' s production planning system.

The algorithm research provides a good reference for engineering applications of the edge detection used in the infrared imaging seeker.

The system is through experimental methods, adjusting the algorithm and parameter data regularly, and finally got satisfactory results.

But the fact remains that this type of overhead is cumbersome and can be a real headache for anyone who is more interested in the algorithm.

The effectiveness of the proposed model and the algorithm is finally verified by the manufacturing practice of an industrial manipulator.

The system physical running effect shows that the algorithm's adjustability and flexibility and control effect are satisfactory.

Every step of the algorithm are connecting the red, blue, choose a set of purple fringing to expand into the T in the light side.

In the actual process of the algorithm from the author found in a fatal drawback is the network extremely unstable, often not the results.

Property specifies the algorithm used to encrypt the message body of a private message.

The result of simulation shows that the algorithm can give satisfactory result of encryption and decryption.

The algorithm for creating a complex object should be independent of the parts that make up the object and how they're assembled.

This says that, given an integer, the algorithm for converting that integer into a MyDouble is provided by the op_Implicit operator.

The algorithm optimizes the selecting form of the cluster head and gateway and operates with fast convergence and low cost.

The algorithm consists of four distinct rounds, which has a slightly different design from that of MD4.

The interaction between the grid size factorization and the symmetry operators and its influence on the algorithm design are discussed.

Experimental results show that the algorithm has higher detection rate and needs less detector numbers. It has optimum overall performance.

The algorithm developed was able to guide a vehicle toward a specified target from a starting point safely and quickly.

Separating the comparison code allows the algorithm to be written in a more general way.

Once the input vectors have passed the "equal size" and "size greater than 1" tests, the heart of the algorithm is executed.

Finally, the simulation results of a security supervising data set in coal mines validate the efficiency of the algorithm.

The results of each processing unit well meet the design objective. It well demonstrated the practicability of the algorithm we brought.

The algorithm can be used to interpret the well test data obtained from by neighboring inclined wells whose production rates are changeable.

The experimental results show that the algorithm is of faster classification speed and higher classification accuracy.

Experimental results show that the retrieval performance of the algorithm is better than that of MARS.

The experiment results show that the algorithm is stable, and the proposed method can be used to reconstruct the plants with large leaves.

At last, with the analysis of a test network as an example, the paper explains the concrete application of the model and the algorithm.

The algorithm or data of every factor in the equation has been determined.

Specifies the maximum number of states for a non-sequence attribute that the algorithm supports.

Experimental results have shown the algorithm can achieve a good performance and can be used to evaluate for large and complex systems.

Implicitly, the algorithm does have one dependency on the element type: We must be able to compare elements.

The algorithm is so simple you can actually memorize it in a few minutes.

One of the jammer structures which can realize the algorithm is given and the method for reducing nonlinear phase errors is presented.

Among the algorithm, improve the simple genetic algorithm by changing the probability of crossover and mutation in dynamic.

The quality of the recommendations as well as the computational performance of the algorithm are promising.

The experimental result shows that the problem is solved by the algorithm effectively, and achieves a more authentic hand movement.

The experiment in the paper proves that the algorithm can decline the system's computing complication and get satisfactory rules.

The algorithm is fast and efficient, it has very few parameters and it is only slightly affected by the image properties.

Project application to a helicopter simulator demonstrates the effectiveness of the algorithm.

The algorithm guarantees precise correspondence between controlling points, higher precision can be obtained.

Theoretical analysis shows that the algorithm model has a high parallel efficiency and a relatively strong versatility.

Examples show that the algorithm of the grammar analyzer can be achieved engineering requirements.

Experiment of two spirals problem proves that the algorithm has higher generalization ability and needs shorter training time.

After analyzing the results, the algorithm is mostly influenced by the RSSI ranging error, the coarse positioning of node can be achieved.

The ALGORITHM clause allows you to choose AES (the default) or AES_FIPS for the FIPS-approved algorithm.

The method uses regions rather than pixels as the seeds of SRG The architecture of the algorithm can be described as follows.

based on the experiment result , we choose the algorithm based on the word class cluster structure similarity getting , and improve on it.

The algorithm can reduce the number of comparisons, and achieve the goal of noise suppression and image details keeping in a fast speed.

The algorithm with such properties is called Strongly Subfeasible Directions Method.

In terms of software, the paper describes the control procedure in the whole and gives the algorithm and software design flow chart.

The simulation registration results show that the algorithm can quickly obtain the best registration parameters with high precision.

Object that encapsulates the algorithm used for XML encryption.

And the algorithm can also be considered as a key technology for developing personalized intelligent search engine.

After simplify the algorithm with a greater extent, the model still maintains the geometrical and visual features of original grids.

Of course, these elaborate design elements mean that the ticket can be undesigned, that the algorithm can be reverse-engineered.

Experiments validate the correctness and effectiveness of the algorithm, and prove that the proposed algorithm has better performance.

Experiment results show that the algorithm is efficient and the features of the original mesh can be preserved perfectly.

Simulations and experiments show that the de- noised signals can be effectively obtained by the algorithm.

All operations involved are performed on integers, so type declarations can speed up the algorithm quite substantially.

for higher order matrix, the origin of translation method can be used to optimize the algorithm to accelerate the convergence.

The algorithm is appropriate when the structural model being optimized is not a complete description of the crystal structure under study.

The analysis shows that the algorithm is of high interpolating speed and can obtain any required interpolating accuracy.

The algorithm of this paper provides a practical and effective method to solve the equilibrium of the complex nonlinear systems.

The experimental result further verify the correctness of the algorithm as well.

State transition matrix is the core of the algorithm, and is the decisive factor of the convergence and convergent rate in this algorithm.

The algorithm consists of two integrated components: trajectory planning algorithm and tracking algorithm.

Analysis results show that the algorithm is capable to withstand multiform attacks and its protective capability is strong.

Therefore, the algorithm can deal with the large scalability of points. Experimental results show that the algorithm is fast and effective.

Generates a random key (Key) to be used for the algorithm.

Simulation results show that the speedup ratio of the algorithm is close to the optimization and that computing time is reduced effectively.

Simulation results show that the algorithm has nice correlation effect and is feasible for engineering application.

Simulated experiments show that AACA has a good ability of searching better solution in the last runs of the algorithm.

Specifies the approximate number of clusters to be built by the algorithm.

The experiments show that the algorithm has great function to improve the imperceptibility and robustness of the concealed information.

In the paper, the algorithm procedure is optimized and verified with software, and a hardware-base system is searched.

The algorithm was testified and proved with a real production case study.

The algorithm that index compresses and relation data is compressed not quite same, the article does not undertake development discussion.

The algorithm was designed for yard fragments, which provided a method for merger between yard fragments during idle time of yard.

But the great distortion makes the post-processing complex, which limits the algorithm applications of classical perspective camera.

The algorithm mainly consists of two basic subroutines: watermark embedding and watermark extraction and detection.

However, for the cluster whose orientation of principal axis is neither horizontal nor vertical, the algorithm does not work.

Experiments with synthetic database were made. The algorithm is better than some previous algorithms for very large database.

Specifically, the algorithm is composed of a number of instructions finite sequence.

Simulation results indicate that the algorithm can predict faults in a class of nonlinear systems with time- varying parameter.

Gets the algorithm used to create the signature of a certificate.

The implementation of the algorithm is efficient and proceeds in less time comparing with the best examples found in the literature.

The main computation in the algorithm is to solve the sequence of linear programming problems for which standard algorithm are available.

The filtering algorithm can operate nonzero-genus meshes directly and smoothly. Experiments demonstrated potentials of the algorithm.

The crux of the algorithm comes in determining whether a node is the root of a strongly connected component.

Global convergence of the algorithm was shown when the solution set of the linear inequalities problem is nonempty and bounded.

The experimental results demonstrate the algorithm is quite accurate and efficient for moving object detection in fixed scenes.

The experimental results demonstrate that the algorithm performs well and a better compensation result is obtained in HSI color space.

The algorithm allows full-matrix least-squares refinement of macromolecular structures without explicit calculation of the normal matrix.

The result shows that the algorithm enjoys good invisibility, meanwhile, it has good robustness towards routine attacks.

The time complexity of the algorithm is 90*O(n3) and its complexity and robustness are better than Hough transformation.

The algorithm resetting of the convergence of the conjugate gradient is also employed to speed up the convergence rate.

The key to the security of a password manager is the algorithm for deciding when to reveal passwords to the current web page.

And the algorithm was used for the map image, and the good experiment result was obtained.

Test demonstrates that the algorithm is efficient for the geometric and attribute feature of the model maintenance.

The algorithm only calculated the first derivative, significantly reduced the computation and had a good convergence.

Verifying test results show that the algorithm is feasible and its precision meets the needs of engineering practices.

The scheduler defines the algorithm used to decide which packets get delayed, dropped, or sent out immediately.

Experimental evaluation shows that the algorithm can work efficiently and the conditioned query answers are more acceptable to users.

A position matrix coding scheme was used to express simultaneously all of composite paths and re-planning information in the algorithm.

The practical application shows that the model and the algorithm can obtain the satisfactory solution of this problem rapidly.

The memory unit mechanism is proposed to strengthen the local search ability of the algorithm and its calculation speed has been improved.

Basis on the request of the algorithm, we design a hardware system and use the TMS320C6201 DSP as the system processor.

The experimental result showed that the accuracy and efficiency of the algorithm satisfies the requirements of color printing.

Practical examples show that the algorithm can preserve the feature of the original model and guarantee the triangle's shape effectively.

The final simulation experiments and preliminary enterprise application show the robustness and availability of the algorithm .

It would be best to reward on a sliding scale, but that would increase the complexity of the algorithm significantly.

So much attention is paid to research the algorithm. Then the artificial fish algorithm is used to search protein folding.

Experimental results show that the algorithm is effective in performing segmentation without too much parameter tuning.

The crossover preserver the snippet of effective genes, and a moving window is used to fasten the algorithm convergence.

Moreover, the approach give good clues for speeding up the algorithm for the computer animation.

The experiments prove the algorithm is an effective steganalysis algorithm for detecting secret message in binary text images.

Ray casting is widely applied in virtual endoscope systems, due to high quality images rendered by the algorithm, but it is time-consuming.

Regardless of the algorithm chosen, trends in hardware and software have made garbage collection far more practical.

The mismatched vertexes are deleted gradually from the searching space, therefore the complexity of the algorithm is reduced significantly.

Obviously, the firm that obtains the algorithm first will propel all of their clients to the top of the search results with ease.

Simulation analysis shows that the algorithm provides real-time transmission and conducts congestion control effectively.

Compared to gradient vector flow algorithm, the algorithm can find better contour in complicated scene, and is robust to the in. . .

Simulation results indicate that the algorithm can improve the performance of fairness bandwidth allocation between different TCP flows.

Property retrieves the identifier of the algorithm used to encrypt the content.

Since the algorithm is independent and compatible, its parameter can be modified easily according to the real operation situation.

The top loop in the algorithm iterates over the list of XML elements and attributes that may appear in the XML document.

Linear constraints can be combined into the linear system in our approach, and the algorithm is of linear complexity.

Since the algorithm could be used to different video and received fairly good effect, it also has the extendibility.

The experimental results show that the algorithm has higher accuracy and efficiency for realtime collision detection in virtual environment.

Traditional analog circuit has limited the implementation of the algorithm for directional speaker and affected the performance.

An arbitrary point on the mapping plane may be reverted to original multi-dimensional space by the algorithm of reversal mapping.

First, if the algorithm examines only a small customer sample, the selected customers will be less similar to the user.

The algorithm established a virtual polar structure through assigning the number of hops and the angel of the scope to the nodes.

Furthermore, the lower and upper bound can be obtained even before completion of the algorithm.

From the discussion in the last column, you may recall that the algorithm to construct a DFA expects a parse tree as input.

Through Monte Carlo experiments the model parameter is adjust for the purpose that the algorithm's performances achieve the desired level.

The experimental results have shown that the algorithm is effectively, and can be used in Image Mosaics well.

We completed the system coding work based on the theoretical analyzing. Experiment results verified the effectiveness of the algorithm.

Through theoretical analysis of algorithms, the algorithm design and implementation have been provided.

The algorithm has less computational complexity and quicker velocity and is especially suitable for large-scale problem.

The algorithm has a kernel of domain knowledge, a base of situation framework and a limitation of background.

A non-interior continuation method is proposed. The global linear convergence and local quadratic convergence of the algorithm are obtained.

A sensitivity analysis was also conducted to the uncertain parameters of receive probability involving in the algorithm.

The algorithm can be used to airflow leakage points identification of ventilation system.

The algorithm used to encrypt the contents is not supported by Communicator.

Experimental results show that the algorithm well balances the simplification efficiency and simplification error.

Simulation show the navigation precision of the algorithm is improved evidently compared with geomagnetic navigation.

The theoretical and experimental results show that the algorithm is effective for the extracting and positioning of angular point.

Before thresholding an object, in each iteration of the thresholding process, the algorithm calculates the size, shape and g. . .

Template Method lets subclass redefine certain steps of an algorithm without changing the algorithm "s structure. "

The result shows that the algorithm is able to obtain accuracy of 87. 58% over a test set of 85 images containing 153 targets.

The fault detection results of experiment are consistent with the given fault scenarios , which verifies the accuracy of the algorithm.

The main idea of the algorithm is that initiative seeds can spread along a determined direction with a certain step length.

Then, the algorithm takes the signed orthogonal distance function as the virtual measurement function to update the local maps in detail.

Simulation results indicate that the algorithm demonstrates good performance for acoustic echo cancellation.

The experimental results show that the algorithm optimizes classification significantly and has good overall stability.

The application example manifests that the algorithm can reconstruct the object three-dimensional surface model efficiently.

The experimental results show that the algorithm for the image edge detection has higher examination speed and better efficiency.