ON THE COMPUTATIONAL COMPLEXITY OF CLUSTERING AND RELATED PROBLEMS

The computational complexity is very small, and the simulation results show that the accuracy of our estimator has increasedsignificantly compared with the conventional DFT-based channel estimator.Copyright © 2009 Yi Wang et al. This is an open access article distributed under the Creative Commons At[r]

354 Z. Hu, H. Leung , and Y. Xu of the template is already known in the database. Hence, the stroke sequence can be easily verified based on the stroke correspondence. Computational complexity. We apply our pruning strategy to the graph matching, and compare the computational time with the existing[r]

ecommunications (ENST),37-39 rue Dareau, 75014 Paris, FranceReceived 30 December 2005; Revised 14 June 2006; Accepted 22 June 2006We propose a new blind minimum mean square error (MMSE) equalization algori thm of noisy multichannel finite impulse re-sponse (FIR) systems, that relies only on second-or[r]

Hindawi Publishing CorporationEURASIP Journal on Wireless Communications and NetworkingVolume 2006, Article ID 25686, Pages 1–12DOI 10.1155/WCN/2006/25686Low Complexity Turbo Equalization for High Data RateWireless CommunicationsDimitris Ampeliotis and Kostas BerberidisComputer Engineering and Infor[r]

Computer science is the scientific and practical approach to computation and its applications. It is the systematic study of the feasibility, structure, expression, and mechanization of the methodical procedures (or algorithms) that underlie the acquisition, representation, processing, storage, comm[r]

Equations with a small parameter can be classified according to the following:(i) the order of the equation remains the same at ε = 0;(ii) the order of the equation reduces at ε = 0.For the first type of equations, solutions of related problems* are sufficiently smooth (littlevarying as ε decreases). T[r]

problems. They do not rely only on calculators and almost never plot graphsusing pencil and paper. Few students submit handwritten reports. Conse-quently, computer-oriented methods are emphasized throughout, and, whereappropriate, time-consuming or tedious computational processes are pre-programmed[r]

Abstract—This paper discusses analysis and synthesis techniques
for robust pole placement in linear matrix inequality
(LMI) regions, a class of convex regions of the complex plane that
embraces most practically useful stability regions. The focus is on
linear systems with static uncertainty on the s[r]

Hindawi Publishing CorporationEURASIP Journal on Advances in Signal ProcessingVolume 2007, Article ID 47921, 10 pagesdoi:10.1155/2007/47921Research ArticleA Complexity-Aware Video Adaptation Mechanism forLive Streaming SystemsMeng-Ting Lu,1Jason J. Yao,1and Homer H. Chen21Department of Electrical En[r]

software is just a part of a complex system. An important topic closely related to thesociotechnical side of RE is that of elicitation. In Chapter III Coulin and Zowghi reviewthe topic and propose some future directions. The problems related to, and the alterna-tives to, conceptual modelling in RE a[r]

We can pick the optimal 𝑘-interchange from a sample of possibilities.We note that the use of more sophisticated strategies allows a better improve-ment in the objective function for each interchange, but also requires moretime for each interchange. For example, the determination of an optimal 𝑘-inte[r]

In this paper we propose and analyze three parallel hybrid extragradient methods for finding a
common element of the set of solutions of equilibrium problems involving pseudomonotone bifunctions
{fi(x, y)}N
i=1 and the set of fixed points of nonexpansive mappings {Sj}M
j=1 in a real Hilbert space.
B[r]

EURASIP Journal on Applied Signal Processing 2003:11, 1091–1109c 2003 Hindawi Publishing CorporationExploiting Acoustic Similarity of PropagatingPaths for Audio Signal SeparationBin YinFaculty of Electrical Engineering, Eindhove n University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Nethe[r]

1060errors. While the algorithm is perhaps the most commonly used clustering algorithm in theliterature, one of its shortcomings is the fact that the number of clusters, K, must be pre-specified.Clustering has been used in many application domains including biology, medicine, an-thropology, marketing[r]

Table 6. Computational results for large-sized problemsAs illustrated in table 6, the proposed MOIA shows better performance in all problem sets. In other words, MOIA provides the higher number of diverse locally non-dominated solutions which are closer to the true Pareto-optimal frontier. Computati[r]

comments and suggestions on the book from all over the world and from a farwider range of readers than anticipated. This is a firm testament of what I claimedin the Preface to the first edition that computational physics is truly the foundationof computational science.The Internet, which connects all[r]

Basic Algorithmic Techniques 77If M[N] ! =−1M[N] = Fib(N −1) + Fib(N −2)return M[N]In this algorithm, the array M stores the optimal solution (Fibonacci values). Whenever thesolution of a subproblem is needed, it could be simply read from this array without having toperform the whole computation aga[r]

EURASIP Journal on Applied Signal Processing 2004:14, 2081–2092c 2004 Hindawi Publishing CorporationFacilitating Watermark Insertionby Preprocessing MediaIngemar J. CoxDepartments of Computer Science and Electronic and Electrical Engineering, University College London,Adastral Park Postgraduate Cam[r]

An original postprandial fasting experiment was conducted in the mouse and the expression of 200 genes was monitored with adedicated macroarray at 11 time points between 0 and 72 hours of fasting. The aim of this study was to provide a relevant clusteringof gene expression temporal profiles. This was[r]

ers of width O(μ|lnμ|)attheboundary∂ω (see [2] for details). We mention that theassumption fu≥ 0in(1.2) can always be obtained via a change of variables.In solving such nonlinear singularly perturbed problems by the finite differencemethod, the corresponding discrete problem is usually formulated as a[r]