Sciweavers

108 search results - page 6 / 22
» Constructing Free Boolean Categories
Sort
View
SIGGRAPH
1997
ACM
15 years 1 months ago
Interactive Boolean operations for conceptual design of 3-D solids
Interactive modeling of 3-D solids is an important and difficult problem in computer graphics. The Constructive Solid Geometry (CSG) modeling scheme is highly attractive for inte...
Ari Rappoport, Steven N. Spitz
DAC
2006
ACM
15 years 10 months ago
Timing-driven Steiner trees are (practically) free
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
Charles J. Alpert, Andrew B. Kahng, Cliff C. N. Sz...
COLING
1992
14 years 11 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
WCRE
1997
IEEE
15 years 1 months ago
Generation of Components for Software Renovation Factories from Context-Free Grammars
We present an approach for the generation of components for a software renovation factory. These components are generated from a context-free grammar definition that recognizes t...
Mark van den Brand, M. P. A. Sellink, Chris Verhoe...
JSYML
2006
85views more  JSYML 2006»
14 years 9 months ago
An alternative semantics for quantified relevant logic
The quantified relevant logic RQ is given a new semantics in which a formula xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are mo...
Robert Goldblatt, Edwin D. Mares