Skip to main content

Research Repository

Advanced Search

All Outputs (50)

Annotated Free-Hand Sketches for Video Retrieval Using Object Semantics and Motion (2012)
Presentation / Conference Contribution
Hu, R., James, S., & Collomosse, J. (2012, January). Annotated Free-Hand Sketches for Video Retrieval Using Object Semantics and Motion. Presented at MMM 2012: Advances in Multimedia Modeling, Klagenfurt, Austria

We present a novel video retrieval system that accepts annotated free-hand sketches as queries. Existing sketch based video retrieval (SBVR) systems enable the appearance and movements of objects to be searched naturally through pictorial representat... Read More about Annotated Free-Hand Sketches for Video Retrieval Using Object Semantics and Motion.

Characterizing graphs of small carving-width (2012)
Presentation / Conference Contribution
Belmonte, R., van 't Hof, P., Kaminski, M., Paulusma, D., & Thilikos, D. (2012, December). Characterizing graphs of small carving-width

We characterize all graphs that have carving-width at most k for k = 1,2,3. In particular, we show that a graph has carving-width at most 3 if and only if it has maximum degree at most 3 and treewidth at most 2. This enables us to identify the immers... Read More about Characterizing graphs of small carving-width.

Obtaining planarity by contracting few edges (2012)
Presentation / Conference Contribution
Golovach, P. A., van 't Hog, P., & Paulusma, D. (2012, December). Obtaining planarity by contracting few edges

The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.

On the Influence of PRNGs on Data Distribution (2012)
Presentation / Conference Contribution
Brinkmann, A., Popov, I., & Friedetzky, T. (2012, December). On the Influence of PRNGs on Data Distribution. Presented at 2012 20th Euromicro International Conference on Parallel, Distributed and Network-based Processing, Munich, Germany

Multiple-Choice Balanced Allocation in (Almost) Parallel (2012)
Presentation / Conference Contribution
Berenbrink, P., Czumaj, A., Englert, M., Friedetzky, T., & Nagel, L. (2012, December). Multiple-Choice Balanced Allocation in (Almost) Parallel. Presented at APPROX/RANDOM 2012, Boston, USA

How to eliminate a graph (2012)
Presentation / Conference Contribution
Golovach, P., Heggernes, P., van 't Hof, P., Manne, F., Paulusma, D., & Pilipczuk, M. (2012, December). How to eliminate a graph

Vertex elimination is a graph operation that turns the neighborhood of a vertex into a clique and removes the vertex itself. It has widely known applications within sparse matrix computations. We define the Elimination problem as follows: given two g... Read More about How to eliminate a graph.

Induced disjoint paths in claw-free graphs (2012)
Presentation / Conference Contribution
Golovach, P. A., Paulusma, D., & van Leeuwen, E. J. (2012, December). Induced disjoint paths in claw-free graphs

Paths P1,…,Pk in a graph G = (V,E) are said to be mutually induced if for any 1 ≤ i < j ≤ k, Pi and Pj have neither common vertices nor adjacent vertices (except perhaps their end-vertices). The Induced Disjoint Paths problem is to test whether a gra...

Induced disjoint paths in AT-free graphs (2012)
Presentation / Conference Contribution
Golovach, P. A., Paulusma, D., & van Leeuwen, E. J. (2012, December). Induced disjoint paths in AT-free graphs

Paths P1,…,Pk in a graph G = (V,E) are said to be mutually induced if for any 1 ≤ i < j ≤ k, Pi and Pj have neither common vertices nor adjacent vertices (except perhaps their end-vertices). The Induced Disjoint Paths problem is to test whether a gra...

The ``Good'' Brother: Monitoring People Activity in Private Spaces (2012)
Presentation / Conference Contribution
Padilla-Lopez, J. R., Florez-Revuelta, F., Monekosso, D. N., & Remagnino, P. (2012, December). The ``Good'' Brother: Monitoring People Activity in Private Spaces. Presented at DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE Univ Salamanca, Bioinformat Intelligent Syst \& Educ Technol Res Grp; IEEE, Syst Man \& Cybernet Soc; AEPIA; APPIA; CNRS

Classification of High-Dimension PDFs Using the Hungarian Algorithm (2012)
Presentation / Conference Contribution
Cope, J. S., & Remagnino, P. (2012, December). Classification of High-Dimension PDFs Using the Hungarian Algorithm. Presented at STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION Int Assoc Pattern Recognit; Int Assoc Pattern Recognit, Tech Comm 1, Stat Pattern Recognit Tech; Int Assoc Pattern Recognit, Tech Comm 2, Struct \& Syntact Pattern Recognit; Tohoku Univ; Hiroshima

Adaptive optical methods for in vivo imaging in developing Zebra fish (2012)
Presentation / Conference Contribution
Girkin, J., Taylor, J., Bourgenot, C., Saunter, C., & Love, G. (2012, December). Adaptive optical methods for in vivo imaging in developing Zebra fish. Presented at 2012 International Symposium on Optomechatronic Technologies (ISOT 2012), Paris

The humble Zebra fish is rapidly establishing itself as the model of choice for a wide range of biological investigations, in particular at the developing embryo stage. Single Plane Illumination Microscopy (SPIM) has already been shown to be a very p... Read More about Adaptive optical methods for in vivo imaging in developing Zebra fish.

Finding vertex-surjective graph homomorphisms (2012)
Presentation / Conference Contribution
Golovach, P. A., Lidicky, B., Martin, B., & Paulusma, D. (2012, December). Finding vertex-surjective graph homomorphisms

The Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows a vertex-surjective homomorphism to some other given graph H called the host graph. The bijective and injective homomorphism problems can be formulat... Read More about Finding vertex-surjective graph homomorphisms.

Closing complexity gaps for coloring problems on H-free graphs (2012)
Presentation / Conference Contribution
Golovach, P. A., Paulusma, D., & Song, J. (2012, December). Closing complexity gaps for coloring problems on H-free graphs

If a graph G contains no subgraph isomorphic to some graph H, then G is called H-free. A coloring of a graph G = (V,E) is a mapping c: V → {1,2,…} such that no two adjacent vertices have the same color, i.e., c(u) ≠ c(v) if uv ∈ E; if |c(V)| ≤ k then... Read More about Closing complexity gaps for coloring problems on H-free graphs.

Kinematic Comparison Between Gender Specific and Traditional Femoral Implants (2012)
Presentation / Conference Contribution
Saevarsson, S., Sharma, G., Montgomery, S., Ho, K., Ramm, H., Lieck, R., Zachow, S., Hutchison, C., Werle, J., & Anglin, C. (2012, December). Kinematic Comparison Between Gender Specific and Traditional Femoral Implants. Presented at 67th Canadian Orthopaedic Association (COA) Annual Meeting