Search for dissertations about: "graph partitioning"
Showing result 11 - 15 of 20 swedish dissertations containing the words graph partitioning.
-
11. PageRank in Evolving Networks and Applications of Graphs in Natural Language Processing and Biology
Abstract : This thesis is dedicated to the use of graph based methods applied to ranking problems on the Web-graph and applications in natural language processing and biology.Chapter 2-4 of this thesis is about PageRank and its use in the ranking of home pages on the Internet for use in search engines. READ MORE
-
12. Towards Unifying Stream Processing over Central and Near-the-Edge Data Centers
Abstract : In this thesis, our goal is to enable and achieve effective and efficient real-time stream processing in a geo-distributed infrastructure, by combining the power of central data centers and micro data centers. Our research focus is to address the challenges of distributing the stream processing applications and placing them closer to data sources and sinks. READ MORE
-
13. Improvements in High-Coverage and Low-Power LBIST
Abstract : Testing cost is one of the major contributors to the manufacturing cost of integrated circuits. Logic Built-In Self Test (LBIST) offers test cost reduction in terms of using smaller and cheaper ATE, test data volume reduction due to on-chip test pattern generation, test time reduction due to at-speed test pattern application. READ MORE
-
14. Skew-symmetric matrix pencils : stratification theory and tools
Abstract : Investigating the properties, explaining, and predicting the behaviour of a physical system described by a system (matrix) pencil often require the understanding of how canonical structure information of the system pencil may change, e.g., how eigenvalues coalesce or split apart, due to perturbations in the matrix pencil elements. READ MORE
-
15. Studies in Efficient Discrete Algorithms
Abstract : This thesis consists of five papers within the design and analysis of efficient algorithms.In the first paper, we consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. We develop a combinatorial randomized algorithm that runs in subcubic time for a special class of graphs. READ MORE