Results 1 - 10 of 388,260

A Sequential Algorithm for Training Text Classifiers

by David D. Lewis, William A. Gale , 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 626 (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

Sequential abstract state machines capture sequential algorithms

by Yuri Gurevich - ACM Trans. Computational logic
"... We examine sequential algorithms and formulate a Sequential Time Postulate, an Abstract State Postulate, and a Bounded Exploration Postulate. Analysis of the postulates leads us to the notion of sequential abstract state machine and to the theorem in the title. First we treat sequential algorithms t ..."
Abstract - Cited by 132 (28 self) - Add to MetaCart
We examine sequential algorithms and formulate a Sequential Time Postulate, an Abstract State Postulate, and a Bounded Exploration Postulate. Analysis of the postulates leads us to the notion of sequential abstract state machine and to the theorem in the title. First we treat sequential algorithms

Sequential algorithms as bistable maps

by unknown authors , 2005
"... We exhibit Cartwright-Curien-Felleisen’s model of observably sequential algorithms as a full subcategory of Laird’s bistable biorders, thereby reconciling two views of functions: functions-as-algorithms (or programs), and functions-as-relations. We then characterize affine sequential algorithms as a ..."
Abstract - Add to MetaCart
We exhibit Cartwright-Curien-Felleisen’s model of observably sequential algorithms as a full subcategory of Laird’s bistable biorders, thereby reconciling two views of functions: functions-as-algorithms (or programs), and functions-as-relations. We then characterize affine sequential algorithms

Games and Sequential Algorithms

by Jim Laird , 2001
"... The relationship between Hyland-Ong-style games and Berry-Curien sequential algorithms is investigated, with the object of describing semantic solutions to two problems | to characterise eectively the \minimal models" of the simply-typed -calculus and the fully abstract model of PCF with co ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
The relationship between Hyland-Ong-style games and Berry-Curien sequential algorithms is investigated, with the object of describing semantic solutions to two problems | to characterise eectively the \minimal models" of the simply-typed -calculus and the fully abstract model of PCF

Sequential Algorithms as Bistable Maps

by Pierre-Louis Curien October, Pierre-louis Curien , 2004
"... In this short note, triggered by [5, 6], I exhibit the model of sequential algorithms as a full subcategory of Laird's bistable bi-orders (without reference to the simple type hierarchy over a speci c base type). All the structures considered here are nite, for simplicity. ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
In this short note, triggered by [5, 6], I exhibit the model of sequential algorithms as a full subcategory of Laird's bistable bi-orders (without reference to the simple type hierarchy over a speci c base type). All the structures considered here are nite, for simplicity.

Sequential algorithms as bistable maps

by unknown authors , 2009
"... We exhibit Cartwright-Curien-Felleisen’s model of observably sequential algorithms as a full subcategory of Laird’s bistable biorders, thereby reconciling two views of functions: functions-as-algorithms (or programs), and functions-as-relations. We then characterize affine sequential algorithms as a ..."
Abstract - Add to MetaCart
We exhibit Cartwright-Curien-Felleisen’s model of observably sequential algorithms as a full subcategory of Laird’s bistable biorders, thereby reconciling two views of functions: functions-as-algorithms (or programs), and functions-as-relations. We then characterize affine sequential algorithms

A universal algorithm for sequential data compression

by Jacob Ziv, Abraham Lempel - IEEE TRANSACTIONS ON INFORMATION THEORY , 1977
"... A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainabl ..."
Abstract - Cited by 1501 (7 self) - Add to MetaCart
A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios

Mining Sequential Patterns

by Rakesh Agrawal, Ramakrishnan Srikant , 1995
"... We are given a large database of customer transactions, where each transaction consists of customer-id, transaction time, and the items bought in the transaction. We introduce the problem of mining sequential patterns over such databases. We present three algorithms to solve this problem, and empiri ..."
Abstract - Cited by 1534 (7 self) - Add to MetaCart
We are given a large database of customer transactions, where each transaction consists of customer-id, transaction time, and the items bought in the transaction. We introduce the problem of mining sequential patterns over such databases. We present three algorithms to solve this problem

A theory of communicating sequential processes

by S. D. Brookes, C. A. R. Hoare, A. W. Roscoe , 1984
"... A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondetermimsm are fully taken into account. ..."
Abstract - Cited by 4135 (17 self) - Add to MetaCart
A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondetermimsm are fully taken into account.

A sequential algorithm for . . .

by David D. Lewis, et al. , 1994
"... The ability to cheaply train text classifiers is critical to their use in information retrieval, content ..."
Abstract - Add to MetaCart
The ability to cheaply train text classifiers is critical to their use in information retrieval, content
Results 1 - 10 of 388,260