Sciweavers

2947 search results - page 61 / 590
» The timely token protocol
Sort
View
KBSE
2008
IEEE
15 years 6 months ago
Using n-grams to rapidly characterise the evolution of software code
Text-based approaches to the analysis of software evolution are attractive because of the fine-grained, token-level comparisons they can generate. The use of such approaches has, ...
Austen Rainer, Peter C. R. Lane, James A. Malcolm,...
ACRI
2006
Springer
15 years 5 months ago
A Maze Routing Algorithm Based on Two Dimensional Cellular Automata
This paper propose a maze routing algorithm based on cellular automata. The aim of this algorithm is find the shortest path between the source cell and the target cell , so that th...
Shahram Golzari, Mohammad Reza Meybodi
EMNLP
2007
15 years 1 months ago
Experiments with a Higher-Order Projective Dependency Parser
We present experiments with a dependency parsing model defined on rich factors. Our model represents dependency trees with factors that include three types of relations between t...
Xavier Carreras
ECIS
2000
15 years 1 months ago
Electronic Notary System and its Certification Mechanism
We have developed a prototype electronic notary system (CYNOS : CYber NOtary System). CYNOS proves facts by providing the evidence (notary token) of events and/or actions that cou...
Shinichi Nakahara
ACL
1994
15 years 1 months ago
A Corpus-Based Approach to Automatic Compound Extraction
An automatic compound retrieval method is proposed to extract compounds within a text message. It uses n-gram mutual information, relative frequency count and parts of speech as t...
Keh-Yih Su, Ming-Wen Wu, Jing-Shin Chang