Search
Skip to Search Results- 43Graduate and Postdoctoral Studies (GPS), Faculty of
- 43Graduate and Postdoctoral Studies (GPS), Faculty of /Theses and Dissertations
- 3Computing Science, Department of
- 3Computing Science, Department of/Technical Reports (Computing Science)
- 2Biological Sciences, Department of
- 2Biological Sciences, Department of/Journal Articles (Biological Sciences)
-
A high-density SNP-based linkage map of the chicken genome reveals sequence features correlated with recombination rate
Download2019-03-01
Gut, Ivo, Lathrop, Mark , Muir, William M. , Foglio, Mario , Wong, Gane K., Groenen, Martien A. , Megens, Hendrik-Jan , Cheng, Hans H. , Besnier, Francois , Crooijmans, Richard PMA , Wahlberg, Per , Andersson, Leif
-
A Novel Method of Measuring Refractory Black Carbon Mass and Number Distributions by Inversion of CPMA-SP2 Data
DownloadFall 2017
A new method of examining mass and number distributions of nanoscale refractive black carbon (rBC) particles has been developed. This method will be useful for atmospheric scientists conducting semi-continuous measurement of atmospheric rBC. The new method uses a Centrifugal Particle Mass...
-
Acoustic and elastic least-squares two-way wave equation migration with exact adjoint operator
DownloadSpring 2017
A major problem in exploration seismology entails estimating subsurface structures and properties via linearized inversion. The problem is often called ''least-squares migration" where seismic imaging is posed as an iterative least-squares problem. The iterative solution employs the method of...
-
Algorithmic Awareness Among Computing Science Students: Exploring Perspectives on Responsible Design and Use of Social Media
DownloadFall 2022
Computational literacy and awareness have emerged as significant public and academic concerns. Implementing robust algorithm systems on social communication platforms may have positive and negative consequences on all age groups in society, particularly on the most frequent users, young adults....
-
1998
Technical report TR98-06. In this paper, we examine the bandwidth problem in circular-arc graphs, chordal graphs with a bounded number of leaves in the clique tree, and k-polygon graphs (fixed k). All of these graph classes admit efficient approximation algorithms which are based on exact or...
-
Fall 2016
In this thesis, we present approximation algorithms for various NP-hard vehicle routing problems, as well as for a related maximum group coverage problem. Our main contribution is a framework to build good constant-factor approximation algorithms for variants of the multi-depot $k$-travelling...