Spelling suggestions: "subject:"eomputer algorithms."" "subject:"aomputer algorithms.""
11 
The power of greediness : a general methodology for designing approximation algorithms /Lau, Hingyip. January 1999 (has links)
Thesis (M. Phil.)University of Hong Kong, 1999. / Includes bibliographical references (leaves 7581).

12 
Efficient stabbing algorithms for a set of objects /Wang, Fulee. January 1999 (has links)
Thesis (M. Phil.)University of Hong Kong, 1999. / Includes bibliographical references (leaves 5559).

13 
Linearsize indexes for approximate pattern matching and dictionary matchingTam, Siulung, January 2010 (has links)
Thesis (Ph. D.)University of Hong Kong, 2010. / Includes bibliographical references (leaves 108115). Also available in print.

14 
Development of computationally efficient and accurate frequency estimation algorithms /Chan, Frankie Kit Wing. January 2005 (has links) (PDF)
Thesis (M. Phil.)City University of Hong Kong, 2005. / "Submitted to Department of Computer Engineering and Information Technology in partial fulfillment of the requirements for the degree of Master of Philosophy." Includes bibliographical references (leaves 5458).

15 
Optimal cycle dating of large financial time seriesKapp, Konrad Phillip January 2017 (has links)
The study of cycles in the context of economic time series has been active for many decades, if not centuries; however, it was only in recent decades that more formal approaches for identifying cycles have been developed. Litvine and Bismans (2015) proposed a new approach for dating cycles in financial time series, for purposes of optimising buysell strategies. In this approach, cycle dating is presented as an optimisation problem. They also introduced a method for optimising this problem, known as the hierarchical method (using full evaluation 2, or HRFE2). However, this method may be impractical for large data sets as it may require unacceptably long computation time. In this study, new procedures that date cycles using the approach proposed by Litvine and Bismans (2015), were introduced, and were speciffically developed to be feasible for large time series data sets. These procedures are the stochastic generation and adaptation (SGA), buysell adapted Extrema importance identity sequence retrieval (BSAEIISR) and buysell adapted bottomup (BSABU) methods. An existing optimisation technique, known as particle swarm optimisation (PSO), was also employed. A statistical comparison was then made between these methods, including HRFE2. This involved evaluating, on simulated data, the performance of the algorithms in terms of objective function value and computation time on different time series lengths, Hurst exponent, and number of buysell points. The SRace methodology (T. Zhang, Georgiopoulos, and Anagnostopoulos 2013) was then applied to these results in order to determine the most effcient methods. It was determined that, statistically, SGA, BSAEIISR and BSABU are the most effcient methods. Number of buysell points was found to have the largest effect on relative performance of these methods. In some cases, the Hurst exponent also has a small effect on relative performance.

16 
Energy efficient online deadline scheduling麥健心, Mak, Kinsum. January 2007 (has links)
published_or_final_version / abstract / Computer Science / Master / Master of Philosophy

17 
Spectral analysis of medial axis for shape descriptionHe, Shuiqing, 何水清 January 2015 (has links)
In this thesis, we make several significant achievements towards defining a medial axis based shape descriptor which is compact, yet discriminative.
First, we propose a novel medial axis spectral shape descriptor called the medial axis spectrum for a 2D shape, which applies spectral analysis directly to the medial axis of a 2D shape. We extend the LaplaceBeltrami operator onto the medial axis of a 2D shape, and take the solution to an extended Laplacian eigenvalue problem defined on this axis as the medial axis spectrum. The medial axis spectrum of a 2D shape is certainly more efficient to compute than spectral analysis of a 2D region, since the efficiency of solving the Laplace eigenvalue problem strongly depends on the domain dimension. We show that the medial axis spectrum is invariant under uniform scaling and isometry of the medial axis. It could also overcome the medial axis noise problem automatically, due to the incorporation of the hyperbolic distance metric. We also demonstrate that the medial axis spectrum inherits several advantages in terms of discriminating power over existing methods.
Second, we further generalize the medial axis spectrum to the description of medial axes of 3D shapes, which we call the medial axis spectrum for a 3D shape. We develop a newly defined MinkowskiEuclidean area ratio inspired by the Minkowski inner product to characterize the geometry of the medial axis surface of a 3D mesh. We then generalize the LaplaceBeltrami operator to the medial axis surface, and take the solution to an extended Laplacian eigenvalue problem defined on the surface as the medial axis spectrum. As the 2D case, the medial axis spectrum of a 3D shape is invariant under rigid transformation and isometry of the medial axis, and is robust to shape boundary noise as shown by our experiments. The medial axis spectrum is finally used for 3D shape retrieval, and its superiority over previous work is shown by extensive comparisons. / published_or_final_version / Computer Science / Doctoral / Doctor of Philosophy

18 
Complexity on some bin packing problems. / CUHK electronic theses & dissertations collectionJanuary 2000 (has links)
by Lau Siu Chung. / "April 2000." / Thesis (Ph.D.)Chinese University of Hong Kong, 2000. / Includes bibliographical references (p. 97102). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.

19 
Algorithms for graph multiway partition problems. / 圖多分割問題的算法研究 / CUHK electronic theses & dissertations collection / Tu duo fen ge wen ti de suan fa yan jiuJanuary 2008 (has links)
For a weighted graph with n vertices and m edges, the Minimum kWay Cut problem is to find a partition of the vertices into k sets that minimizes the total weight of edges crossing the sets. We obtain several important structural properties of minimum multiway cuts and use them to design efficient algorithms for several multiway partition problems. We design the first algorithm for finding minimum 3way cuts in hypergraphs, which runs in O(dmn 3) time, where d is the sum of the degrees of all the vertices. We also give an O(n 4klg k) algorithm for finding all minimum kway cuts in graphs. Our algorithm is based on a divideandconquer method and improves all wellknown existing algorithms along this divideandconquer method. As for approximation algorithms, we determine the tight approximation ratio of a general greedy splitting algorithm (finding a minimum kway cut by iteratively increasing a constant number of components). Our result implies that the approximation ratio of the algorithm that iteratively increases h  1 components is 2  h/k + O(h2 /k2), which settles a wellknown open problem. / For an unweighted graph and a given subset T ⊂ V of k terminals, the Edge (respectively, Vertex) Multiterminal Cut problem is to find a set of l edges (respectively, nonterminal vertices), whose removal from G separates each terminal from all the others. We show that Edge Multiterminal Cut is polynomialtime solvable for 1 = O(log n) by presenting an O(2lkT(n, m)) algorithm, where T(n, m) is the running time of finding a maximum flow in unweighted graphs. We also give three algorithms for Vertex Multiterminal Cut that run in O(k lT(n, m)), O( l!2 2l T(n, m)) and O(lk 4lT( n, m)) time respectively. Furthermore, we obtain faster algorithms for small k: Edge 3Terminal Cut can be solved in O(1.415lT(n, m)) time, and Vertex {3, 4, 5, 6}Terminal Cuts can be solved in O(2.059 lT(n, m)), O(2.772 lT(n, m)), O(3.349 lT(n, m)) and O(3.857 lT(n, m)) times respectively. Our results on Multiterminal Cut can be used to obtain faster algorithms for Multicut. / In this thesis, we study algorithmic issues for three closely related partition problems in graphs: kWay Cut (kCut), Multiterminal Cut, and Multicut. These three problems attempt to separate a graph, by edge or vertex deletion, into several components with certain properties. The kWay Cut (kCut) problem is to separate the graph into k components, the Multiterminal Cut problem is to separate a subset of vertices away from each other, and the Multicut problem is to separate some given pairs of vertices. These three problems have many applications in parallel and distributed computing, VLSI system design, clustering problems, communications network and many others. / Xiao, Mingyu. / Adviser: Andrew C. Yao. / Source: Dissertation Abstracts International, Volume: 7006, Section: B, page: 3617. / Thesis (Ph.D.)Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 8592). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.

20 
Mining multilevel association rules using data cubes and mining Nmost interesting itemsets.January 2000 (has links)
by Kwong, WangWai Renfrew. / Thesis (M.Phil.)Chinese University of Hong Kong, 2000. / Includes bibliographical references (leaves 102105). / Abstracts in English and Chinese. / Abstract  p.ii / Acknowledgments  p.iv / Chapter 1  Introduction  p.1 / Chapter 1.1  Data Mining Tasks  p.1 / Chapter 1.1.1  Characterization  p.2 / Chapter 1.1.2  Discrimination  p.2 / Chapter 1.1.3  Classification  p.2 / Chapter 1.1.4  Clustering  p.3 / Chapter 1.1.5  Prediction  p.3 / Chapter 1.1.6  Description  p.3 / Chapter 1.1.7  Association Rule Mining  p.4 / Chapter 1.2  Motivation  p.4 / Chapter 1.2.1  Motivation for Mining Multilevel Association Rules Using Data Cubes  p.4 / Chapter 1.2.2  Motivation for Mining Nmost Interesting Itemsets  p.8 / Chapter 1.3  Outline of the Thesis  p.10 / Chapter 2  Survey on Previous Work  p.11 / Chapter 2.1  Data Warehousing  p.11 / Chapter 2.1.1  Data Cube  p.12 / Chapter 2.2  Data Mining  p.13 / Chapter 2.2.1  Association Rules  p.14 / Chapter 2.2.2  Multilevel Association Rules  p.15 / Chapter 2.2.3  MultiDimensional Association Rules Using Data Cubes  p.16 / Chapter 2.2.4  Apriori Algorithm  p.19 / Chapter 3  Mining Multilevel Association Rules Using Data Cubes  p.22 / Chapter 3.1  Use of Multilevel Concept  p.22 / Chapter 3.1.1  Multilevel Concept  p.22 / Chapter 3.1.2  Criteria of Using Multilevel Concept  p.23 / Chapter 3.1.3  Use of Multilevel Concept in Association Rules  p.24 / Chapter 3.2  Use of Data Cube  p.25 / Chapter 3.2.1  Data Cube  p.25 / Chapter 3.2.2  Mining Multilevel Association Rules Using Data Cubes  p.26 / Chapter 3.2.3  Definition  p.28 / Chapter 3.3  Method for Mining Multilevel Association Rules Using Data Cubes  p.31 / Chapter 3.3.1  Algorithm  p.33 / Chapter 3.3.2  Example  p.35 / Chapter 3.4  Experiment  p.44 / Chapter 3.4.1  Simulation of Data Cube by Array  p.44 / Chapter 3.4.2  Simulation of Data Cube by B+ Tree  p.48 / Chapter 3.5  Discussion  p.54 / Chapter 4  Mining the Nmost Interesting Itemsets  p.56 / Chapter 4.1  Mining the Nmost Interesting Itemsets  p.56 / Chapter 4.1.1  Criteria of Mining the Nmost Interesting itemsets  p.56 / Chapter 4.1.2  Definition  p.58 / Chapter 4.1.3  Property  p.59 / Chapter 4.2  Method for Mining Nmost Interesting Itemsets  p.60 / Chapter 4.2.1  Algorithm  p.60 / Chapter 4.2.2  Example  p.76 / Chapter 4.3  Experiment  p.81 / Chapter 4.3.1  Synthetic Data  p.81 / Chapter 4.3.2  Real Data  p.85 / Chapter 4.4  Discussion  p.98 / Chapter 5  Conclusion  p.100 / Bibliography  p.101 / Appendix  p.106 / Chapter A  Programs for Mining the Nmost Interesting Itemset  p.106 / Chapter A.1  Programs  p.106 / Chapter A.2  Data Structures  p.108 / Chapter A.3  Global Variables  p.109 / Chapter A.4  Functions  p.110 / Chapter A.5  Result Format  p.113 / Chapter B  Programs for Mining the Multilevel Association Rules Using Data Cube  p.114 / Chapter B.1  Programs  p.114 / Chapter B.2  Data Structure  p.118 / Chapter B.3  Variables  p.118 / Chapter B.4  Functions  p.119

Page generated in 0.2523 seconds