Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,052,924 papers from all fields of science
Search
Sign In
Create Free Account
Preprocessor
Known as:
Precompiler
, Pre-process
, Preprocessing directive
Expand
In computer science, a preprocessor is a program that processes its input data to produce output that is used as input to another program. The output…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Aspect weaver
Assertion (software development)
Autoconf
Boilerplate code
Expand
Broader (1)
Programming language implementation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Character-based Neural Machine Translation
Wang Ling
,
I. Trancoso
,
Chris Dyer
,
A. Black
arXiv.org
2015
Corpus ID: 5799549
We introduce a neural machine translation model that views the input and output sentences as sequences of characters rather than…
Expand
Highly Cited
2010
Highly Cited
2010
Syntax-to-Morphology Mapping in Factored Phrase-Based Statistical Machine Translation from English to Turkish
Reyyan Yeniterzi
,
Kemal Oflazer
Annual Meeting of the Association for…
2010
Corpus ID: 14292100
We present a novel scheme to apply factored phrase-based SMT to a language pair with very disparate morphological structures. Our…
Expand
Highly Cited
2006
Highly Cited
2006
A new complicated-knowledge representation approach based on knowledge meshes
Hong-Sen Yan
IEEE Transactions on Knowledge and Data…
2006
Corpus ID: 14514132
This paper presents a new complicated-knowledge representation method for the self-reconfiguration of complex systems such as…
Expand
Highly Cited
2002
Highly Cited
2002
Gate sizing using Lagrangian relaxation combined with a fast gradient-based pre-processing step
Hiran Tennakoon
,
C. Sechen
IEEE/ACM International Conference on Computer…
2002
Corpus ID: 53244448
In this paper, we present Forge, an optimal algorithm for gate sizing using the Elmore delay model. The algorithm utilizes…
Expand
Highly Cited
2001
Highly Cited
2001
Key-posture extraction out of human motion data
I. S. Lim
,
D. Thalmann
Conference Proceedings of the 23rd Annual…
2001
Corpus ID: 10352615
Recent progress in 3-D capture technology has made it possible to obtain much of realistic motion data of human subjects. Being…
Expand
Highly Cited
1996
Highly Cited
1996
Application of Wavelet Packet Transform in Pattern Recognition of Near-IR Data
B. Walczak
,
and Bas van den Bogaert
,
D. Massart
1996
Corpus ID: 18454136
The wavelet packet transform is studied as a tool for improving pattern recognition based on near-infrared spectra. Application…
Expand
Highly Cited
1996
Highly Cited
1996
Mapping Ecological Land Systems and Classification Uncertainties from Digital Elevation and Forest-Cover Data Using Neural Networks
P. Gong
,
R. Pu
,
J. Chen
1996
Corpus ID: 53991763
Our approaches in this project emphasized mainly the technical aspects of the land-systems classification problem with neural…
Expand
Highly Cited
1991
Highly Cited
1991
Functional description of MINTO : a mixed integer optimizer
M. Savelsbergh
,
G. Sigismondi
,
G. Nemhauser
1991
Corpus ID: 5456527
MINTO is a software system that solves mixed-integer linear programs by a branch-and-bound algorithm with linear programming…
Expand
Highly Cited
1989
Highly Cited
1989
Illumination networks: fast realistic rendering with general reflectance functions
Chris Buchalew
,
D. Fussell
International Conference on Computer Graphics and…
1989
Corpus ID: 1200684
We present a technique for modeling global illumination which allows a wide variety of reflectance functions. Scene coherence is…
Expand
Highly Cited
1977
Highly Cited
1977
Finding the rib cage in chest radiographs
H. Wechsler
,
J. Sklansky
Pattern Recognition
1977
Corpus ID: 14613807
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE