Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 222,876,885 papers from all fields of science
Search
Sign In
Create Free Account
Octal
Known as:
Oct
, Base eight
, Octal system
Expand
The octal numeral system, or oct for short, is the base-8 number system, and uses the digits 0 to 7. Octal numerals can be made from binary numerals…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
24-bit
36-bit
4-bit
ANSI escape code
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Morte encefálica e cuidados na manutenção do potencial doador de órgãos e tecidos para transplante
Izaura Luzia Silvério Freire
,
A. Mendonça
,
Vamilson Oliveira de Pontes
,
Q. L. D. A. Q. D. Vasconcelos
,
Gilson de Vasconcelos Torres
2012
Corpus ID: 72948742
This is an exploratory-descriptive study performed using a quantitative approach and prospective data, with the objective to…
Expand
2012
2012
Fast Integral Equation Solution by Multilevel Green's Function Interpolation Combined With Multilevel Fast Multipole Method
D. Schobert
,
T. Eibert
IEEE Transactions on Antennas and Propagation
2012
Corpus ID: 23452954
A fast wideband integral equation (IE) solver combining the multilevel interpolatory fast Fourier transform accelerated approach…
Expand
2011
2011
Nonlinear, dispersive, and phase-matching properties of the new chalcopyrite CdSiP_2 [Invited]
V. Kemlin
,
B. Boulanger
,
+4 authors
K. Zawilski
2011
Corpus ID: 44004394
We compare the nonlinear and dispersive properties of the recently discovered mid-infrared nonlinear crystal CdSiP2 with other…
Expand
2008
2008
Precision feeding and forage management effects on phosphorus loss modeled at a watershed scale
L. Ghebremichael
,
T. Veith
,
J. Hamlett
,
W. Gburek
Journal of Soil and Water Conservation
2008
Corpus ID: 55400034
Delaware County and the Cornell Cooperative Extension of Delaware County of New York State have initiated a farm-scale precision…
Expand
Highly Cited
2005
Highly Cited
2005
Efficient solution of EFIE via low-rank compression of multilevel predetermined interactions
D. Gope
,
V. Jandhyala
IEEE Transactions on Antennas and Propagation
2005
Corpus ID: 22745359
This paper describes the predetermined interaction list oct-tree (PILOT) algorithm and its application in expediting the solution…
Expand
2003
2003
IAIS: A Methodology to Enable Inter-Agency Information Sharing In eGovernment
A. Bajaj
,
S. Ram
Journal of Database Management
2003
Corpus ID: 17671243
Recently, there has been increased interest in information sharing among government agencies, with a view toward improving…
Expand
Highly Cited
1996
Highly Cited
1996
Tree data structures for N-body simulation
Richard J. Anderson
Proceedings of 37th Conference on Foundations of…
1996
Corpus ID: 15145190
In this paper, we study data structures for use in N-body simulation. We concentrate on the spatial decomposition tree used in…
Expand
1996
1996
Application of fast parallel and sequential tree codes to computing three-dimensional flows with the vortex element and boundary element methods
G. Winckelmans
,
J. Salmon
,
Michael S. Warren
,
A. Leonard
,
B. Jodoin
1996
Corpus ID: 17799575
A fast parallel oct-tree code originally developed for three-dimensional N-body gravitational simulations was modified into (1) a…
Expand
1994
1994
A generic model for reuseable lexicons: the genelex project
Marie-Hélène Antoni-Lay
,
Gil Francopoulo
,
Laurence Zaysser
1994
Corpus ID: 60755708
Genelex (oct. 90 - oct.94) est un projet EUREKA avec pour objectifs : (1) la definition d'un modele generique de lexiques, (2) le…
Expand
Highly Cited
1991
Highly Cited
1991
Three-dimensional image segmentation using a split, merge and group approach
K. C. Strasters
,
J. J. Gerbrands
Pattern Recognition Letters
1991
Corpus ID: 5551259
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