In this paper, a graph matching method and a distance between attributed graphs are defined. Both approaches are based on graph probes. Probes can be seen as features exctracted from a given graph. They represent a local information. According two graphs G1,G2, the univalent mapping can be expresssed as the minimum-weight probe matching between G1 and G2 with respect to the cost function c. 1 P...

We investigate classroom assignments and resulting student work to identify important characteristics of assignments in terms of instructional quality and their validity as measures of teaching quality. We examine assignment quality within a large-scale project exploring multiple measures including classroom observations, teacher knowledge measures, and value-added estimates based on student ac...

This research investigates the problem of how to adapt the changing of quorum assignments for objects in a replicated database to the duration and extent of failures occurring in the underlying communication network. The concept of a view based on a connected component of the network is used to coordinate changes to quorum assignments of different objects. New view formation is used only when n...

We study the structure of satisfying assignments of a random 3-Sat formula. In particular, we show that a random formula of density α ≥ 4.453 almost surely has no non-trivial “core” assignments. Core assignments are certain partial assignments that can be extended to satisfying assignments, and have been studied recently in connection with the Survey Propagation heuristic for random Sat. Their ...

Several algorithms have been proposed for generating satisfactory state assignments for normal fundamental mode asynchronous sequential circuits. Programmed versions of minimal and near-minimal techniques have been incorporated in automated synthesis systems, but are known to require computational efforts which increase exponentially with flow table size. Other methods, requiring much less effo...

A computational method for the assignment of the NMR spectra of larger (21 kDa) proteins using a set of six of the most sensitive heteronuclear multidimensional nuclear magnetic resonance experiments is described. Connectivity data obtained from HNC alpha, HN(CO)C alpha, HN(C alpha)H alpha, and H alpha (C alpha CO)NH and spin-system identification data obtained from CP-(H)CCH-TOCSY and CP-(H)C(...

We describe a method of processing hyperspectral images of natural scenes that uses a combination of kmeans clustering and locally linear embedding (LLE). The primary goal is to assist anomaly detection by preserving spectral uniqueness among the pixels. In order to reduce redundancy among the pixels, adjacent pixels which are spectrally similar are grouped using the k-means clustering algorith...

In this paper we propose a method to solve the stereo correspondence problem. The method matches features and feature relationships and can be paraphrased as follows. Linear edge segments are extracted from both the left and right images. Each such segment is characterized by its position and orientation in the image as well as its relationships with the nearby segments. A relational graph is t...