Results 1 - 10 of 20,525

AN n 5/2 ALGORITHM FOR MAXIMUM MATCHINGS IN BIPARTITE GRAPHS

by John E. Hopcroft, Richard M. Karp , 1973
"... The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/. ..."
Abstract - Cited by 702 (1 self) - Add to MetaCart
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/.

Dynamic Logic

by David Harel, Dexter Kozen, Jerzy Tiuryn - Handbook of Philosophical Logic , 1984
"... ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possibl ..."
Abstract - Cited by 1012 (7 self) - Add to MetaCart
ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all

The x-Kernel: An Architecture for Implementing Network Protocols

by Norman C. Hutchinson, Larry L. Peterson - IEEE Transactions on Software Engineering , 1991
"... This paper describes a new operating system kernel, called the x-kernel, that provides an explicit architecture for constructing and composing network protocols. Our experience implementing and evaluating several protocols in the x-kernel shows that this architecture is both general enough to acc ..."
Abstract - Cited by 662 (21 self) - Add to MetaCart
This paper describes a new operating system kernel, called the x-kernel, that provides an explicit architecture for constructing and composing network protocols. Our experience implementing and evaluating several protocols in the x-kernel shows that this architecture is both general enough

The English Noun Phrase in its Sentential Aspect

by Steven Paul Abney - PH.D. DISSERTATION MIT , 1987
"... This dissertation is a defense of the hypothesis that the noun phrase is headed by a functional element (i.e., "non-lexical" category) D, identified with the determiner. In this way, the structure of the noun phrase parallels that of the sentence, which is headed by Infl(ection), under ass ..."
Abstract - Cited by 532 (4 self) - Add to MetaCart
phrases. The problem of capturing this dual aspect of the Possing construction is heightened by current restrictive views of X-bar theory, which, in particular, rule out the obvious structure for Poss-ing, [ NP NP VP ing ], by virtue of its exocentricity. Consideration of languages in which nouns, even

A Simple Estimator of Cointegrating Vectors in Higher Order Cointegrated Systems

by James H. Stock, Mark W. Watson - ECONOMETRICA , 1993
"... Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions. T ..."
Abstract - Cited by 524 (3 self) - Add to MetaCart
Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions

MEGA5: Molecular evolutionary genetics analysis using maximum . . .

by Koichiro Tamura, Daniel Peterson, Nicholas Peterson, Glen Stecher, Masatoshi Nei, Sudhir Kumar , 2011
"... Comparative analysis of molecular sequence data is essential for reconstructing the evolutionary histories of species and inferring the nature and extent of selective forces shaping the evolution of genes and species. Here, we announce the release of Molecular Evolutionary Genetics Analysis version ..."
Abstract - Cited by 7284 (25 self) - Add to MetaCart
) analyses for inferring evolutionary trees, selecting best-fit substitution models (nucleotide or amino acid), inferring ancestral states and sequences (along with probabilities), and estimating evolutionary rates site-by-site. In computer simulation analyses, ML tree inference algorithms in MEGA5 compared

Wait-Free Synchronization

by Maurice Herlihy - ACM Transactions on Programming Languages and Systems , 1993
"... A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a wait-free implementation of one data object from another lie ..."
Abstract - Cited by 851 (28 self) - Add to MetaCart
A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a wait-free implementation of one data object from another

W4: Real-time surveillance of people and their activities

by Ismail Haritaoglu, David Harwood, Larry S. Davis - IEEE Transactions on Pattern Analysis and Machine Intelligence , 2000
"... w4 is a real time visual surveillance system for detecting and tracking multiple people and monitoring their activities in an outdoor environment. It operates on monocular gray-scale video imagery, or on video imagery from an infrared camera. W4 employs a combination of shape analysis and tracking t ..."
Abstract - Cited by 709 (9 self) - Add to MetaCart
and track them. W4 can also determine whether people are carrying objects, and can segment objects from their silhouettes, and construct appearance models for them so they can be identified in subsequent frames. W4 can recognize events between people and objects, such as depositing an object, exchanging

The irreducibility of the space of curves of given genus

by P. Deligne, D. Mumford - Publ. Math. IHES , 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~- ..."
Abstract - Cited by 506 (2 self) - Add to MetaCart
is to construct families of curves X, some singular, with pa(X)-=g, over non-singular parameter spaces, which in some sense contain enough singular curves to link together any two components that Mg might have. The essential thing that makes this method work now is a recent " stable reduction theorem "

Model-Based Analysis of Oligonucleotide Arrays: Model Validation, Design Issues and Standard Error Application

by Cheng Li, Wing Hung Wong , 2001
"... Background: A model-based analysis of oligonucleotide expression arrays we developed previously uses a probe-sensitivity index to capture the response characteristic of a specific probe pair and calculates model-based expression indexes (MBEI). MBEI has standard error attached to it as a measure of ..."
Abstract - Cited by 775 (28 self) - Add to MetaCart
correlations with the original 20-probe PM/MM difference model. MBEI method is able to extend the reliable detection limit of expression to a lower mRNA concentration. The standard errors of MBEI can be used to construct confidence intervals of fold changes, and the lower confidence bound of fold change is a
Results 1 - 10 of 20,525