29681011
A strong lower bound for approximate nearest neighbor searching
We prove a lower bound of d1-o(1) on the query time for any deterministic algorithms that solve approximate nearest neighbor searching in Yao's cell probe model. Our result greatly improves the best previous lower bound for this problem, which is Ω(loglogd/logloglogd) [A. Chakrabarti et al., in: Proc. 31st Ann. ACM Symp. Theory of Computing, 1999, pp. 305-311]. Our proof is also much simpler than the proof of A. Chakrabarti et al.
915132
On Randomized Broadcasting and Gossiping in Radio Networks
This paper has two parts. In the first part we give an alternative (and much simpler) proof for the best known lower bound of ?(Dlog (N/D)) time-steps for randomized broadcasting in radio networks with unknown topology. In the second part we give an O(N log3N)- time randomized algorithm for gossiping in such radio networks. This is an improvement over the fastest previously known algorithm that works in time O(N log4 N).
38675279
On-Line Learning Control for Discrete Nonlinear Systems Via an Improved ADDHP Method
This paper mainly discusses a generic scheme for on-line adaptive critic design for nonlinear system based on neural dynamic programming (NDP), more exactly, an improved action-depended dual heuristic dynamic programming (ADDHP) method. The principal merit of the proposed method is to avoid the model neural network which predicts the state of next time step, and only use current and previous states in the method, as makes the algorithm more suitable for real-time or on-line application for process control. In this paper, convergence proof of the method will also be given to guarantee the control to reach the optimal. At last, simulation result verifies the performance.
1796961
Dynamically Constructing Classification Rules with Visualization Techniques
31887438
Robust Stability Analysis of a Class of Hopfield Neural Networks with Multiple Delays
The robust stability of a class of Hopfield neural networks with multiple delays is analyzed. Sufficient conditions for the global robust stability of the equilibrium point are established through constructing a suitable Lyapunov-Krasovskii functional. The present results take the form of linear matrix inequalities, and are computationally efficient. In addition, the results are independent of delays and established without assuming differentiability and monotonicity of the activation function.
16371053
Discovering Useful Concept Prototypes for Classification Based on Filtering and Abstraction
The nearest-neighbor algorithm and its derivatives have been shown to perform well for pattern classification. Despite their high classification accuracy, they suffer from high storage requirement, computational cost, and sensitivity to noise. We develop anew framework, called ICPL (Integrated Concept Prototype Learner), which integrates instance-filtering and instance-abstraction techniques by maintaining a balance of different kinds of concept prototypes according to instance locality. The abstraction component, based on typicality, employed in our ICPL framework is specially designed for concept integration. We have conducted experiments on a total of 50 real-world benchmark data sets. We find that our ICPL framework maintains or achieves better classification accuracy and gains a significant improvement in data reduction compared with existing filtering and abstraction techniques as well as some existing techniques.
14012169
Efficient k nearest neighbor queries on remote spatial databases using range estimation
We propose a k-NN query processing algorithm that uses one or more window queries to retrieve the nearest neighbors of a given query point. We also propose two different methods to estimate the ranges to be used by the window queries. Each range estimation method requires different statistical knowledge about the spatial databases. Our experiments on the TIGER data allow us to study the behavior of the proposed algorithm using different range estimation methods. Apart from not requiring direct access to the spatial indices, the window queries used in the proposed algorithm can be easily supported by non-spatial database systems containing spatial objects.