Outputs (107)

Approximating Fixation Probabilities in the Generalized Moran Process (2012)
Presentation / Conference Contribution
Díaz, J., Goldberg, L., Mertzios, G., Richerby, D., Serna, M., & Spirakis, P. (2012, November). Approximating Fixation Probabilities in the Generalized Moran Process. Presented at Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012, Kyoto, Japan

We consider the Moran process, as generalized by Lieberman, Hauert and Nowak (Nature, 433:312--316, 2005). A population resides on the vertices of a finite, connected, undirected graph and, at each time step, an individual is chosen at random with pr... Read More about Approximating Fixation Probabilities in the Generalized Moran Process.

Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems (2012)
Journal Article
Dantchev, S., & Martin, B. (2013). Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. Computational Complexity, 22(1), 191-213. https://doi.org/10.1007/s00037-012-0049-1

We prove a dichotomy theorem for the rank of propositional contradictions, uniformly generated from first-order sentences, in both the Lovász-Schrijver (LS) and Sherali-Adams (SA) refutation systems. More precisely, we first show that the proposition... Read More about Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems.

Radiological Method for Measuring Patellofemoral Tracking and Tibiofemoral Kinematics before and after Total Knee Replacement (2012)
Journal Article
Sharma, G., Saevarsson, S., Amiri, S., Montgomery, S., Ramm, H., Lichti, D., Lieck, R., Zachow, S., & Anglin, C. (2012). Radiological Method for Measuring Patellofemoral Tracking and Tibiofemoral Kinematics before and after Total Knee Replacement. Bone & Joint Research, 1(10), 263-271. https://doi.org/10.1302/2046-3758.110.2000117

Blood vessel segmentation methodologies in retinal images - A survey (2012)
Journal Article
Fraz, M., Remagnino, P., Hoppe, A., Uyyanonvara, B., Rudnicka, A., Owen, C., & Barman, S. (2012). Blood vessel segmentation methodologies in retinal images - A survey. Computer Methods and Programs in Biomedicine, 108(1), 407-433. https://doi.org/10.1016/j.cmpb.2012.03.009

What Do We Know About the Effectiveness of Software Design Patterns? (2012)
Journal Article
Zhang, C., & Budgen, D. (2012). What Do We Know About the Effectiveness of Software Design Patterns?. IEEE Transactions on Software Engineering, 38(5), 1213-1231. https://doi.org/10.1109/tse.2011.79

Fully Automatic 3D Threat Image Projection: Application to Densely Cluttered 3D Computed Tomography Baggage Images (2012)
Presentation / Conference Contribution
Megherbi, N., Breckon, T., Flitton, G., & Mouton, A. (2012, October). Fully Automatic 3D Threat Image Projection: Application to Densely Cluttered 3D Computed Tomography Baggage Images. Presented at Proc. International Conference on Image Processing Theory, Tools and Applications

Query-driven Parallel Exploration of Large Datasets (2012)
Presentation / Conference Contribution
Atanasov, A., Srinivasan, M., & Weinzierl, T. (2012, October). Query-driven Parallel Exploration of Large Datasets. Presented at Large Data Analysis and Visualization (LDAV), 2012 IEEE Symposium on

The role of models@run.time in supporting on-the-fly interoperability (2012)
Journal Article
Bencomo, N., Bennaceur, A., Grace, P., Blair, G., & Issarny, V. (2013). The role of models@run.time in supporting on-the-fly interoperability. Computing, 95(3), 167-190. https://doi.org/10.1007/s00607-012-0224-x

Computing vertex-surjective homomorphisms to partially reflexive trees (2012)
Journal Article
Golovach, P., Paulusma, D., & Song, J. (2012). Computing vertex-surjective homomorphisms to partially reflexive trees. Theoretical Computer Science, 457, 86-100. https://doi.org/10.1016/j.tcs.2012.06.039

A homomorphism from a graph GG to a graph HH is a vertex mapping f:VG→VHf:VG→VH such that f(u)f(u) and f(v)f(v) form an edge in HH whenever uu and vv form an edge in GG. The HH-Coloring problem is that of testing whether a graph GG allows a homomorph... Read More about Computing vertex-surjective homomorphisms to partially reflexive trees.

A general technique to establish the asymptotic conditional diagnosability of interconnection networks (2012)
Journal Article
Stewart, I. (2012). A general technique to establish the asymptotic conditional diagnosability of interconnection networks. Theoretical Computer Science, 452, 132-147. https://doi.org/10.1016/j.tcs.2012.05.015