Sciweavers

6167 search results - page 248 / 1234
» Can Refinement be Automated
Sort
View
IJCAI
2001
15 years 7 months ago
Integrating Expectations from Different Sources to Help End Users Acquire Procedural Knowledge
Role-limiting approaches using explicit theories of problem-solving have been successful for acquiring knowledge from domain experts1 . However most systems using this approach do...
Jim Blythe
COLING
1992
15 years 7 months ago
Construction Of Corpus-Based Syntactic Rules For Accurate Speech Recognition
This paper describes the syntactic rules which are applied in the Japanese speech recognition module of a speech-to-speech translation system. Japanese is considered to be a free ...
Junko Hosaka, Toshiyuki Takezawa
CGF
2008
188views more  CGF 2008»
15 years 6 months ago
Real-Time Rendering and Editing of Vector-based Terrains
We present a method to populate very large terrains with very detailed features such as roads, rivers, lakes and fields. These features can be interactively edited, and the landsc...
Eric Bruneton, Fabrice Neyret
IANDC
2006
97views more  IANDC 2006»
15 years 6 months ago
Pure bigraphs: Structure and dynamics
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
Robin Milner
RE
2002
Springer
15 years 5 months ago
AGORA: Attributed Goal-Oriented Requirements Analysis Method
This paper presents an extended version of GoalOriented Requirements Analysis Method called AGORA, where attribute values, e.g. contribution values and preference matrices, are ad...
Haruhiko Kaiya, Hisayuki Horai, Motoshi Saeki