Sciweavers

100 search results - page 14 / 20
» Strict Basic Superposition
Sort
View
CADE
1994
Springer
14 years 20 days ago
Simple Termination Revisited
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...
Aart Middeldorp, Hans Zantema
SIGGRAPH
1995
ACM
14 years 3 days ago
Creation and rendering of realistic trees
Recent advances in computer graphics have produced images approaching the elusive goal of photorealism. Since many natural objects are so complex and detailed, they are often not ...
Jason Weber, Joseph Penn
EURONGI
2008
Springer
13 years 10 months ago
Performance Evaluation of DTSN in Wireless Sensor Networks
The guaranteed delivery of critical data is an essential requirement in most Wireless Sensor Network (WSN) applications. The paucity of energy, communication, processing and storag...
Francisco Rocha, António Grilo, Paulo Rog&e...
CASCON
2006
117views Education» more  CASCON 2006»
13 years 10 months ago
A backtracking LR algorithm for parsing ambiguous context-dependent languages
Parsing context-dependent computer languages requires an ability to maintain and query data structures while parsing for the purpose of influencing the parse. Parsing ambiguous co...
Adrian D. Thurston, James R. Cordy
ACL
1992
13 years 9 months ago
Metonymy: Reassessment, Survey of Acceptability, and its Treatment in a Machine Translation System
In this article we outline a basic approach to treating metonymy properly in a multilingual machine translation system. This is the first attempt at treating metonymy in an machin...
Shin-ichiro Kamei, Takahiro Wakao