Outputs (61)

Deterministic Choices in a Data-driven Parser (2015)
Conference Proceeding
Jaf, S., Ramsay, A., Sharp, B., Lubaszewski, W., & Delmonte, R. (2015). Deterministic Choices in a Data-driven Parser. In Natural language processing and cognitive science : proceedings 2015 (95-103)

Data-driven parsers rely on recommendations from parse models, which are generated from a set of training data using a machine learning classifier, to perform parse operations. However, in some cases a parse model cannot recommend a parse action to a... Read More about Deterministic Choices in a Data-driven Parser.

The Application of Constraint Rules to Data-driven Parsing (2015)
Conference Proceeding
Jaf, S., Ramsay, A., Angelova, G., Bontcheva, K., & Mitkov, R. (2015). The Application of Constraint Rules to Data-driven Parsing. In Recent advances in natural language processing : 10th International conference, RANLP 2015, 7-9 September 2015, Hissar, Bulgaria ; proceedings (232-238)

In this paper, we show an approach to extracting different types of constraint rules from a dependency treebank. Also, we show an approach to integrating these constraint rules into a dependency data-driven parser, where these constraint rules inform... Read More about The Application of Constraint Rules to Data-driven Parsing.

Runway detection in high resolution remote sensing data (2015)
Conference Proceeding
Jackson, P. T., Nelson, C. J., Schiefeley, J., & Obara, B. (2015). Runway detection in high resolution remote sensing data. In ISPA 2015 : 9th International Symposium on Image and Signal Processing and Analysis, 7-9 September 2015, Zagreb, Croatia ; proceedings (170-175). https://doi.org/10.1109/ispa.2015.7306053

Runways are vital descriptive features of airports and knowledge of their location is important to many aviation and military applications. With the recent wide availability of remote sensing data, there is demand for an automatic process of extracti... Read More about Runway detection in high resolution remote sensing data.

Evaluating the Resilience of Face Recognition Systems Against Malicious Attacks (2015)
Conference Proceeding
Omar, L., & Ivrissimtzis, I. (2015). Evaluating the Resilience of Face Recognition Systems Against Malicious Attacks. In X. Xie, M. W. Jones, & G. K. L. Tam (Eds.), Proceedings of the 7th UK Computer Vision Student Workshop (BMVW) (5.1-5.9). https://doi.org/10.5244/c.29.bmvw.5

This paper presents an experiment designed to test the resilience of several user verification systems based on face recognition technology against simple identity spoofing methods, such as trying to gain access to the system by using mobile camera s... Read More about Evaluating the Resilience of Face Recognition Systems Against Malicious Attacks.

Shifting Opinions: Experiments on Agreement and Disagreement in Dialogue (2015)
Conference Proceeding
Concannon, S., Healey, P., & Purver, M. (2015). Shifting Opinions: Experiments on Agreement and Disagreement in Dialogue.

Bounding the Clique-Width of H-free Chordal Graphs (2015)
Conference Proceeding
Brandstädt, A., Dabrowski, K., Huang, S., & Paulusma, D. (2015). Bounding the Clique-Width of H-free Chordal Graphs. In Mathematical foundations of computer science 2015 : 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, proceedings, part II (139-150). https://doi.org/10.1007/978-3-662-48054-0_12

A graph is H-free if it has no induced subgraph isomorphic to H. Brandstädt, Engelfriet, Le and Lozin proved that the class of chordal graphs with independence number at most 3 has unbounded clique-width. Brandstädt, Le and Mosca erroneously claimed... Read More about Bounding the Clique-Width of H-free Chordal Graphs.

The price of connectivity for cycle transversals (2015)
Conference Proceeding
Hartinger, T., Johnson, M., Milanič, M., & Paulusma, D. (2015). The price of connectivity for cycle transversals. In Mathematical foundations of computer science 2015 : 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, proceedings, part II (395-406). https://doi.org/10.1007/978-3-662-48054-0_33

For a family of graphs F, an F-transversal of a graph G is a subset S⊆V(G) that intersects every subset of V(G) that induces a subgraph isomorphic to a graph in F. Let tF(G) be the minimum size of an F-transversal of G, and ctF(G) be the minimum size... Read More about The price of connectivity for cycle transversals.

Minimal disconnected cuts in planar graphs (2015)
Conference Proceeding
Kamiński, M., Paulusma, D., Stewart, A., & Thilikos, D. M. (2015). Minimal disconnected cuts in planar graphs. In A. Kosowski, & I. Walukiewicz (Eds.), Fundamentals of computation theory : 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, proceedings (243-254). https://doi.org/10.1007/978-3-319-22177-9_19

The problem of finding a disconnected cut in a graph is NP-hard in general but polynomial-time solvable on planar graphs. The problem of finding a minimal disconnected cut is also NP-hard but its computational complexity is not known for planar graph... Read More about Minimal disconnected cuts in planar graphs.

On the mathematics of data centre network topologies (2015)
Conference Proceeding
Stewart, I. (2015). On the mathematics of data centre network topologies. In A. Kosowski, & I. Walukiewicz (Eds.), Fundamentals of computation theory : 20th international symposium, FCT 2015, Gdańsk, Poland, August 17 - 19, 2015 ; proceedings (283-295). https://doi.org/10.1007/978-3-319-22177-9_22

In a recent paper, combinatorial designs were used to construct switch-centric data centre networks that compare favourably with the ubiquitous (enhanced) fat-tree data centre networks in terms of the number of servers within (given a fixed server-to... Read More about On the mathematics of data centre network topologies.

From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP (2015)
Conference Proceeding
Carvalho, C., Madelaine, F. R., & Martin, B. (2015). From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP. In Proceedings, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2015) : 6-10 July 2015, Kyoto, Japan (462-474). https://doi.org/10.1109/lics.2015.50

Inspired by computational complexity results for the quantified constraint satisfaction problem, we study the clones of idem potent polymorphisms of certain digraph classes. Our first results are two algebraic dichotomy, even "gap", theorems. Buildin... Read More about From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP.