Search results
Results from the WOW.Com Content Network
Color bleeding (computer graphics) Color cycling; Composite Bézier curve; Compositing; Computational geometry; Compute kernel; Computer animation; Computer art; Computer graphics; Computer graphics (computer science) Computer graphics lighting; Computer-generated imagery; Cone tracing; Constructive solid geometry; Control point (mathematics ...
The Computer Science Ontology (CSO) is an automatically generated taxonomy of research topics in the field of Computer Science. [ 1 ] [ 2 ] It was produced by the Open University in collaboration with Springer Nature by running an information extraction system over a large corpus of scientific articles. [ 3 ]
Physics, mathematics, computer science, nonlinear sciences, quantitative biology and statistics: Repository of electronic pre-prints of papers in the fields of mathematics, physics, astronomy, computer science, quantitative biology, statistics, and quantitative finance. Free Cornell University [18] ASCE Library: Civil engineering
Computer science is a broad field which encompasses a number of different kinds of ideas. The structure of the main part of an article will vary with the type of article. Here are some general guidelines for structuring a few different classes of computer science articles.
The ACM Computing Research Repository uses a classification scheme that is much coarser than the ACM subject classification, and does not cover all areas of CS, but is intended to better cover active areas of research. In addition, papers in this repository are classified according to the ACM subject classification.
It includes their operation and usage, the electrical processes carried out within the computing hardware itself, and the theoretical concepts governing them (computer science). See also: List of programmers , List of computing people , List of computer scientists , List of basic computer science topics , List of terms relating to algorithms ...
This is a list of computability and complexity topics, by Wikipedia page. Computability theory is the part of the theory of computation that deals with what can be computed, in principle.
Conferences whose topic is algorithms and data structures considered broadly, but that do not include other areas of theoretical computer science such as computational complexity theory: ESA – European Symposium on Algorithms; SODA – ACM–SIAM Symposium on Discrete Algorithms; SWAT and WADS – SWAT and WADS conferences