In this work we evaluate the use of several real-time dense stereo algorithms as a passive 3D sensing technology for potential use as part of a driver assistance system or autonomous vehicle guidance. A key limitation in prior work in this area is that although significant comparative work has been done on dense stereo algorithms using de facto laboratory test sets only limited work has been do...

A graph G is called randomly H − decomposable if every maximal H − packing in G uses all edges in G. G is called H − equipackable if every maximal H − packing in G is also a maximum H − packing in G. M2 − decomposable graphs, randomly M2 − decomposable graphs and M2 − equipackable graphs have been characterized. The definitions could be generalized to multigraphs. And M2 − decomposable multigra...

Given a query sequence, Q, of length m and a database, D, of length n, BLAST attempts to find all maximal segment pairs with statistically significant scores. Recall that a Maximal Segment Pair (MSP) is an ungapped local alignment whose score cannot be improved by extending or shortening the alignment. The data base is a series of concatenated amino acid sequences M1,M2, . . .Mj . . .. Figure 1...

The chromatic index of a bipartite graph equals the maximal degree of its vertices. The straightforward way to compute the corresponding edge coloring using colors, requires O((2 n 3=2) time. We will show that a simple divide & conquer algorithm only requires O((3=2 n 3=2) time. This algorithm uses an algorithm for perfect k-matching in regular bipartite graphs as a sub-routine. We will show th...

We present a novel approach for tracking space-filling features, i.e., a set of features covering the entire domain. The assignment between successive time steps is determined by a two-step, global optimization scheme. First, a maximum-weight, maximal matching on a bi-partite graph is computed to provide one-to-one assignments between features of successive time steps. Second, events are detect...

Suppose that independent U 0 1 weights are assigned to the (d2)n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expected weight of the minimum-weight perfect d-dimensional matching is at least 3 16n 1− 2/d . We describe a randomized algorithm that finds a perfect d-dimensional matching whose expected weight is at most 5d3n1− 2/d + d1...

Xtatic is an extension of C with native support for statically typed XML processing. It features XML trees as built-in values, “tree grep” pattern matching, and an XML-specific type system. An implementation ofXtatic must address a number of issues common to any language supporting a declarative style of XML processing (e.g., XQuery, XSLT, XDuce, CDuce, Xact, Xen, etc.). In particular, it must ...

This paper addresses the problem of face recognition using a graphical representation to identify structure that is common to pairs of images. Matching graphs are constructed where nodes correspond to image locations and edges are dependent on the relative orientation of the nodes. Similarity is determined from the size of maximal matching cliques in pattern pairs. The method uses a single refe...

We present a fast derandomization scheme for the PROFIT/COST problem. Through the applications of this scheme we show the time complexity of O(log 2 n loglog n) for the + 1 vertex coloring problem using O((m + n)= log logn) processors on the CREW PRAM, the time complexity of O(log 2:5 n) for the maximal independent set problem using O((m+n)= log 1:5 n) processors on the CREW PRAM and the time c...

This paper studies the maximal size of product-free sets in Z/nZ. These are sets of residues for which there is no solution to ab ≡ c (mod n) with a, b, c in the set. In a previous paper we constructed an infinite sequence of integers (ni)i≥1 and product-free sets Si in Z/niZ such that the density |Si|/ni → 1 as i → ∞, where |Si| denotes the cardinality of Si. Here we obtain matching, up to con...