#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2006

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We present a fast converging method for distance-based phylogenetic inference, which is novel in two respects. First, it is the only method (to our knowledge) to guarantee accuracy when knowledge about the model tree, i.e bounds on the edge lengths, is not assumed. Second, our algorithm guarantees that, with high probability, no false assertions are made.â€¦ (More)

- Radu Mihaescu, Cameron Hill, Satish Rao
- Algorithmica
- 2012

Given natural limitations on the length DNA sequences, designing phylogenetic reconstruction methods which are reliable under limited information is a crucial endeavor. There have been two approaches to this problem: reconstructing partial but reliable information about the tree (Mossel in IEEE Comput. Biol. Bioinform. 4:108â€“116, 2007; Daskalakis et al. inâ€¦ (More)

- Rhema Linder, Nic Lupfer, +6 authors Elizabeth Kellogg
- Creativity & Cognition
- 2015

We investigate how presentation in a free-form medium stimulates free-form thinking and discussion in the classroom. Most classroom presentations utilize slideware (e.g. PowerPoint). Yet, slides add intrusive segregations that obstruct the flow of information. In contrast, in a <i>free-form medium of presentation</i>, content is not separated into rigidâ€¦ (More)

- Uri Andrews, Dmitriy Dushenin, Cameron Hill, Julia F. Knight, Alexander G. Melnikov
- 2013

The notion of Turing computable embedding [4] provides an effective way to compare classes of countable structures, reducing the classification problem for one class to that for the other. Most of the known results on non-existence of Turing computable embeddings reflect differences in the complexity of the sentences needed to distinguish amongâ€¦ (More)

Consider a connected undirected graph G with n vertices and m edges, where each edge has some probability p of failing. What is the probability that G becomes disconnected under random, independent edge failures? This can also be viewed as a counting problem, except that each item now has an associated weight: in particular, we want to compute the sum ofâ€¦ (More)

- Matthieu Giraud-Carrier, Cameron Hill, +4 authors Holger Schmidt
- 2015 IEEE 58th International Midwest Symposium onâ€¦
- 2015

This paper presents an approach to quantifying the diffusion rate of rubidium in glass microchannels. These types of microchannels are often used in integrated systems (chip and fiber based) which utilize light and rubidium vapor interactions to produce quantum interference phenomena such as slow light. The test platforms reported here were made using glassâ€¦ (More)

- Nic Lupfer, Rhema Linder, +4 authors Kade Keith
- 2016

We investigate how students engage in free-form web curation as a means of design ideation. Free-form web curation is a spontaneous, improvisational, and divergent creative process that involves choosing, sketching, writing, and assembling elements spatially. We take a design research approach, involving iterative design of a web curation system andâ€¦ (More)

- â€¹
- 1
- â€º