Learning Decompositional Shape Models from Examples Alex Levinshtein Master of Science Graduate Department of Computer Science University of Toronto 2005 We present an algorithm for automatically constructing a decompositional shape model from examples. Unlike current approaches to structural model acquisition, in which one-to-one correspondences among appearance-based features are used to cons...

We show that the full version of the so-called ‘rural hospital theorem’ (Roth, 1986) generalizes to many-to-many matching where agents on both sides of the market have separable and substitutable preferences.

We count the number of alignments of N ≥ 1 sequences when match-up types are from a specified set S ⊆ N . Equivalently, we count the number of nonnegative integer matrices whose rows sum to a given fixed vector and each of whose columns lie in S. We provide a new asymptotic formula for the case S = {(s1, . . . , sN ) | 1 ≤ si ≤ 2}.

A simple procedure to tighten the Lagrangian bounds is proposed. The approach is interpreted in two ways. First, it can be seen as a reformulation of the original problem aimed to split the resulting Lagrangian problem into two subproblems. Second, it can be considered as a search for a tighter estimation of the penalty term arising in the Lagrangian problem. The new bounds are illustrated by a...

Given two point sets S and T , we study the many-to-many matching with demands problem (MMD problem) which is a generalization of the many-to-many matching problem (MM problem). In an MMD, each point of one set must be matched to a given number of the points of the other set (each point has a demand). In this paper we consider a special case of MMD problem, the one-dimensional MMD (OMMD), where...

This paper describes ThreadMon, a monitoring tool for improving the performance of multithreaded programs, and how we have used it to examine various aspects of the many-to-many (or two-level) threads implementation model. We run unmodified binary subject code, insert software probes to collect data, and analyze and present the results in real time on another machine. We show that the behavior ...

RASTA (Rhetorical Structure Theory Analyzer), a system for automatic discourse analysis, reliably, identifies rhetorical relations present m written discourse by examining information available in syntactic and logical form analyses. Since there is a many-to-many relationship between rhetorical relations and elements of linguistic form, RASTA identifies relations by the convergence of a number ...

Development is fundamentally about understanding people, their Motivations, behaviors and reactions. We have two primary means of understanding people— observing what they do, and what they say. As the AI4D community has noted, people’s increased use of mobile devices has led to a wealth of new data relevant to these topics. We are on the cusp of developing incredibly powerful tools that can he...

We deal with embedding a large scale knowledge graph composed of entities and relations into a continuous vector space. TransE is a promising method proposed recently, which is very efficient while achieving state-of-the-art predictive performance. We discuss some mapping properties of relations which should be considered in embedding, such as reflexive, one-to-many, many-to-one, and many-to-ma...

This paper presents a novel algorithm to spot a known video sequence within a live video stream. The algorithm is split into two branches, a branch to create a digital signature out of the video sequence in question, and another is to search for this sequence within a live video stream. The algorithm is categorized to consume low processing power and satisfy real-time requirements. Thus, this a...