Results 1  10
of
415
Automatic Word Sense Discrimination
 Journal of Computational Linguistics
, 1998
"... This paper presents contextgroup discrimination, a disambiguation algorithm based on clustering. Senses are interpreted as groups (or clusters) of similar contexts of the ambiguous word. Words, contexts, and senses are represented in Word Space, a highdimensional, realvalued space in which closen ..."
Abstract

Cited by 536 (1 self)
 Add to MetaCart
closeness corresponds to semantic similarity. Similarity in Word Space is based on secondorder cooccurrence: two tokens (or contexts) of the ambiguous word are assigned to the same sense cluster if the words they cooccur with in turn occur with similar words in a training corpus. The algorithm
3D Model Acquisition from Extended Image Sequences
, 1995
"... This paper describes the extraction of 3D geometrical data from image sequences, for the purpose of creating 3D models of objects in the world. The approach is uncalibrated  camera internal parameters and camera motion are not known or required. Processing an image sequence is underpinned by token ..."
Abstract

Cited by 236 (29 self)
 Add to MetaCart
by token correspondences between images. We utilise matching techniques which are both robust (detecting and discarding mismatches) and fully automatic. The matched tokens are used to compute 3D structure, which is initialised as it appears and then recursively updated over time. We describe a novel robust
Token Graphs
, 2009
"... For a graph G and integer k ≥ 1, we define the token graph Fk(G) to be the graph with vertex set all ksubsets of V (G), where two vertices are adjacent in Fk(G) whenever their symmetric difference is a pair of adjacent vertices in G. Thus vertices of Fk(G) correspond to configurations of k indistin ..."
Abstract
 Add to MetaCart
For a graph G and integer k ≥ 1, we define the token graph Fk(G) to be the graph with vertex set all ksubsets of V (G), where two vertices are adjacent in Fk(G) whenever their symmetric difference is a pair of adjacent vertices in G. Thus vertices of Fk(G) correspond to configurations of k
Tokens and Writing: the Cognitive Development
"... The paper analyses the development of the power of abstraction as illustrated by the evolution of counting in the ancient Near East. Tokens indicate that counting was first done concretely in onetoone correspondence. The clay tokens, that appeared in the Near East about 7500 BC, abstracted the goo ..."
Abstract
 Add to MetaCart
The paper analyses the development of the power of abstraction as illustrated by the evolution of counting in the ancient Near East. Tokens indicate that counting was first done concretely in onetoone correspondence. The clay tokens, that appeared in the Near East about 7500 BC, abstracted
Tokens for anonymous Communications in the Internet
"... With the growth and acceptance of the Internet, there has been increased interest in maintaining anonymity in the network. Using traffic analysis, it is possible to infer who is talking to whom over a public network. This work develops a novel approach to hide the senders and the receivers of messag ..."
Abstract
 Add to MetaCart
of messages. Routes are chosen and frames traverse these routes. Each frame consists of a token and a node can send a message through a frame only when the corresponding token is free. The best thing about our protocol is that it poses no bandwidth overhead when there is at least some traffic while posing
Token Tracking in a Cluttered Scene
 Image and Vision Computing
, 1993
"... The statistical data association technique is an important approach to analyze long sequences of images in Computer Vision. Although it has extensively been studied in other domains such as in radar imagery, it was introduced only recently in Computer Vision, and is already recognized as an efficien ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
as an efficient approach to solving correspondence and motion problems. This paper has two purposes. The first is to present a general formulation of token tracking. The parameterization of tokens is not addressed. This might be useful to those who are not familiar with statistical tracking techniques. The second
Figure 1. Security Token
"... This paper describes a conceptual authorization model for Web Services. It is an adaptation of those of Taos [Lamp92] and SDSI [Lamp96] with terms changed to correspond more closely to those introduced with the WSSecurity model [WS02]. In contrast to the more formal and mathematical presentation us ..."
Abstract
 Add to MetaCart
This paper describes a conceptual authorization model for Web Services. It is an adaptation of those of Taos [Lamp92] and SDSI [Lamp96] with terms changed to correspond more closely to those introduced with the WSSecurity model [WS02]. In contrast to the more formal and mathematical presentation
On the permutational power of token passing networks
, 2004
"... Abstract. A token passing network is a directed graph with one or more specified input vertices and one or more specified output vertices. A vertex of the graph may be occupied by at most one token, and tokens are passed through the graph. The reorderings of tokens that can arise as a result of this ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of this process are called the language of the token passing network. It was known that these languages correspond through a natural encoding to certain regular languages. We show that the collection of such languages is relatively restricted, in particular that only finitely many occur over each fixed alphabet
Permutations generated by token passing in graphs
, 1997
"... A transportation graph is a directed graph with a designated input node and a designated output node. Initially, the input node contains an ordered set of tokens 1,2,3,.. The tokens are removed from the input node in this order and transferred through the graph to the output node in a series of move ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
A transportation graph is a directed graph with a designated input node and a designated output node. Initially, the input node contains an ordered set of tokens 1,2,3,.. The tokens are removed from the input node in this order and transferred through the graph to the output node in a series
Token Identity Vs. Type Identity
"... Idsardi and Raimy 2000 (I&R) propose that the representations posited by a learner are constrained by economy considerations. If a child hears a string like the Temiar continuative [sglOg], two possibilities are available while building the underlying representation of the string. Either the two ..."
Abstract
 Add to MetaCart
the two segments [g] perceived in the string correspond to different tokens of the same type, or they correspond to the same token in the input representation. The analysis of Temiar proposed by I&R leads to the conclusion that repetition of the same token could be the answer in this case, assuming
Results 1  10
of
415