Institutional Repository

Browsing FACULTY OF NATURAL & APPLIED SCIENCES by Subject "Algorithms"

Browsing FACULTY OF NATURAL & APPLIED SCIENCES by Subject "Algorithms"

Sort by: Order: Results:

  • Experimenting with HITS based Algorithms with new Heuristics for assigning the link weights 
    Maroun, Bashir M. (Notre Dame University-Louaize, 2001)
    This thesis uses the link structure of the World Wide Web as a basis to create better search engines. It focuses on the HITS algorithm, which was the first algorithm to up the link topology. HITS is implemented with slight modifications and tested with variations of its input parameters. It is also used in order to discover emerging communities in cyberspace. Other related algorithms, which use the link structure of the web as an undirected graph are described and compared with HITS. Finally, an attempt to combine link-based with text-based analysis in order to create more accurate search methods ...
  • Integrating Neural networks and GIS for solving the travelling salesman problem 
    Ibrahim, Rita Jack (Notre Dame University-Louaize, 2000-06)
    In this thesis, we investigate the use of neural networks for solving the Traveling Salesman Problem (TSP). First, we review the main elements of the theory of NP-completeness. Then, we explain what makes some problems computationally intractable. We review some heuristic approaches used to provide near-optimal solutions to NP-complete problems. Then, we introduce the topic of neural networks and describe some of the most popular neural network models. We pay a special attention to a recent model, named the Hybrid Neural Network model (HNN), used for solving optimization problems and the Hybrid ...
  • Practical results from hits with new heuristics for assigning the link weights 
    Karaa, George Emile (Notre Dame University-Louaize, 2001)
    This thesis addresses the problem of analysis the Web hyperlink structure in order to locate authoritative web pages relevant to a certain query subject. In particular, we discuss the HITS algorithm, a pioneering method that exploits the web link structure in order to locate important information sources, as well as other algorithms based on HITS such as ARC and Page Rank. We experiment with different aspects of HITS, and introduce new heuristics for assigning the link weights based on textual contexts.
  • A test-bed for linear time, constant space differencing algorithms 
    Mouawad, Pauline (Notre Dame University-Louaize, 2004)
    This thesis is motivated by the latest work related to differential compression algorithms as it appears in the work of Ajtai, et al. - 2002. In particular, we pay special attention to delta encoding algorithms that achieve got compression in linear time and constant space. This is important because previous work in this area uses either quadratic time and constant space or linear time and linear space, which is unacceptable for large inputs. In delta encoding, the algorithm reads two different copies of the same file as input, termed the reference copy and the version copy. The output of the ...
  • Toward an interactive internet search engine 
    Akl, Imad M. (Notre Dame University-Louaize, 2002-06)
    This thesis uses the HITS algorithm as a basis to propose an interactive internet search engine. With the Web becoming a major source of information for many users, it became a necessity to be able to search the Web efficiently. The main problem resides with broad topic queries. These are queries for which a typical text-based search engine like AltaVista would return thousands of pages. A remedy for these situations was proposed by Kleinberg in his 1-IITS algorithm in which he uses the hyperlink structure of the Web as a major source of information about the contents of the Web. In this thesis, ...

Search DSpace


Advanced Search

Browse

My Account