Results 1  10
of
3,585
A Sequential Algorithm for Training Text Classifiers
, 1994
"... The ability to cheaply train text classifiers is critical to their use in information retrieval, content analysis, natural language processing, and other tasks involving data which is partly or fully textual. An algorithm for sequential sampling during machine learning of statistical classifiers was ..."
Abstract

Cited by 631 (10 self)
 Add to MetaCart
The ability to cheaply train text classifiers is critical to their use in information retrieval, content analysis, natural language processing, and other tasks involving data which is partly or fully textual. An algorithm for sequential sampling during machine learning of statistical classifiers
The Nature and Growth of Vertical Specialization in World Trade
 Journal of International Economics
"... Abstract: Dramatic changes are occurring in the nature of international trade. Production processes increasingly involve a sequential, vertical trading chain stretching across many countries, with each country specializing in particular stages of a good’s production sequence. We document a key aspe ..."
Abstract

Cited by 481 (20 self)
 Add to MetaCart
Abstract: Dramatic changes are occurring in the nature of international trade. Production processes increasingly involve a sequential, vertical trading chain stretching across many countries, with each country specializing in particular stages of a good’s production sequence. We document a key
The Extended Linear Complementarity Problem
, 1993
"... We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the biline ..."
Abstract

Cited by 788 (30 self)
 Add to MetaCart
We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity
Diagnosing multiple faults.
 Artificial Intelligence,
, 1987
"... Abstract Diagnostic tasks require determining the differences between a model of an artifact and the artifact itself. The differences between the manifested behavior of the artifact and the predicted behavior of the model guide the search for the differences between the artifact and its model. The ..."
Abstract

Cited by 808 (62 self)
 Add to MetaCart
procedure. Third, the diagnostic procedure is incremental, exploiting the iterative nature of diagnosis. Fourth, a clear separation is drawn between diagnosis and behavior prediction, resulting in a domain (and inference procedure) independent diagnostic procedure. Fifth, GDE combines modelbased prediction
Estimating the Support of a HighDimensional Distribution
, 1999
"... Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We propo ..."
Abstract

Cited by 783 (29 self)
 Add to MetaCart
of the weight vector in an associated feature space. The expansion coefficients are found by solving a quadratic programming problem, which we do by carrying out sequential optimization over pairs of input patterns. We also provide a preliminary theoretical analysis of the statistical performance of our
On the Sequential Nature of Interprocedural ProgramAnalysis Problems
, 1995
"... In this paper,westudy twointerprocedural programanalysis problemsinterprocedural slicing and interprocedural dataflowanalysisand present the following results: .Interprocedural slicing is logspace complete for P. .The problem of obtaining "meetoverallvalidpaths" solutions to i ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
In this paper,westudy twointerprocedural programanalysis problemsinterprocedural slicing and interprocedural dataflowanalysisand present the following results: .Interprocedural slicing is logspace complete for P. .The problem of obtaining "meetoverallvalidpaths" solutions to interprocedural versions of distributive dataflowanalysis problems is Phard. .Obtaining "meetoverallvalidpaths" solutions to interprocedural versions of distributive dataflowanalysis problems that involvefinite sets of dataflowfacts (such as the classical "gen/kill" problems) is logspace complete for P. These results provide evidence that there do not exist fast (NCclass) parallel algorithms for interprocedural slicing and precise interprocedural dataflowanalysis (unless P = NC). That is, it is unlikely that there are algorithms for interprocedural slicing and precise interprocedural dataflowanalysis for which the number of processors is bounded by a polynomial in the size of the input, and w...
Sequential Monte Carlo Samplers
, 2002
"... In this paper, we propose a general algorithm to sample sequentially from a sequence of probability distributions known up to a normalizing constant and defined on a common space. A sequence of increasingly large artificial joint distributions is built; each of these distributions admits a marginal ..."
Abstract

Cited by 303 (44 self)
 Add to MetaCart
In this paper, we propose a general algorithm to sample sequentially from a sequence of probability distributions known up to a normalizing constant and defined on a common space. A sequence of increasingly large artificial joint distributions is built; each of these distributions admits a marginal
On the Sequential Nature ofInterprocedural ProgramAnalysis Problems
"... Abstract In this paper, westudy two interprocedural programanalysis problems—interprocedural slicing and interprocedural dataflow analysis—and present the following results: • Interprocedural slicing is logspace complete forP. • The problem of obtaining “meetoverallvalidpaths ” solutions to in ..."
Abstract
 Add to MetaCart
Abstract In this paper, westudy two interprocedural programanalysis problems—interprocedural slicing and interprocedural dataflow analysis—and present the following results: • Interprocedural slicing is logspace complete forP. • The problem of obtaining “meetoverallvalidpaths ” solutions to interprocedural dataflow analysis problems isPhard. • Obtaining “meetoverallvalidpaths ” solutions to interprocedural gen/kill dataflow analysis problems is logspace complete forP. These results provide evidence that there do not exist fast (NCclass) parallel algorithms for interprocedural slicing and interprocedural dataflow analysis (unlessP ⊆NC). That is, it is unlikely that there are algorithms for interprocedural slicing and interprocedural dataflow analysis for which the number of processors is bounded by a polynomial in the size of the input, and whose running time is bounded by a polynomial in the logarithm of the size of the input. This suggests that there are limitations on the ability to use parallelism to overcome compiler bottlenecks due to expensive interproceduralanalysis computations. 1.
FiniteState Transducers in Language and Speech Processing
 Computational Linguistics
, 1997
"... Finitestate machines have been used in various domains of natural language processing. We consider here the use of a type of transducers that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential stringtostring transducer ..."
Abstract

Cited by 392 (42 self)
 Add to MetaCart
Finitestate machines have been used in various domains of natural language processing. We consider here the use of a type of transducers that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential string
How to improve Bayesian reasoning without instruction: Frequency formats
 Psychological Review
, 1995
"... Is the mind, by design, predisposed against performing Bayesian inference? Previous research on base rate neglect suggests that the mind lacks the appropriate cognitive algorithms. However, any claim against the existence of an algorithm, Bayesian or otherwise, is impossible to evaluate unless one s ..."
Abstract

Cited by 396 (29 self)
 Add to MetaCart
specifies the information format in which it is designed to operate. The authors show that Bayesian algorithms are computationally simpler in frequency formats than in the probability formats used in previous research. Frequency formats correspond to the sequential way information is acquired in natural
Results 1  10
of
3,585