Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,283,924 papers from all fields of science
Search
Sign In
Create Free Account
Algorithm engineering
Algorithm Engineering focuses on the design, analysis, implementation, optimization, profiling and experimental evaluation of computer algorithms…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Algorithm
Algorithm design
Graphical system design
John Hershberger
Expand
Broader (1)
Theoretical computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
EXPERIMENTAL COMPARISON OF MATRIX ALGORITHMS FOR DATAFLOW COMPUTER ARCHITECTURE
J. Mihelic
,
Uros Cibej
Acta Electrotechnica et Informatica
2018
Corpus ID: 69570004
In this paper we draw our attention to several algorithms for the dataflow computer paradigm, where the dataflow computation is…
Expand
2014
2014
Amplitude estimate of the radio signal with unknown duration and initial phase
A. P. Trifonov
,
Y. Korchagin
,
M. Trifonov
,
O. Chernoyarov
,
A. A. Artemenko
2014
Corpus ID: 54088369
Quasi-likelihood and maximum likelihood estimate algorithms of the amplitude of a radio signal with free-form envelope and…
Expand
2013
2013
Symmetric searchable encryption for exact pattern matching using directed Acyclic Word Graphs
Rolf Haynberg
,
Jochen Rill
,
Dirk Achenbach
,
J. Müller-Quade
International Conference on Security and…
2013
Corpus ID: 10132143
Searchable Encryption schemes allow searching within encrypted data without prior decryption. Various index-based schemes have…
Expand
2013
2013
Algorithm Engineering for Realistic Journey Planning in Transportation Networks
Thomas Pajor
2013
Corpus ID: 41314062
Diese Dissertation beschaftigt sich mit der Routenplanung in Transportnetzen. Es werden neue, effiziente algorithmische Ansatze…
Expand
2012
2012
Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time
H. Bodlaender
,
Marek Cygan
,
Stefan Kratsch
,
Jesper Nederlof
arXiv.org
2012
Corpus ID: 18411099
It is well known that many local graph problems, like Vertex Cover and Dominating Set, can be solved in 2^{O(tw)}|V|^{O(1)} time…
Expand
2004
2004
Netzwerkvisualisierung (Network Visualization)
Ulrik Brandes
,
D. Wagner
2004
Corpus ID: 7020648
Zusammenfassung Das Thema Netzwerkvisualisierung umfasst alle Aspekte der Darstellung relationaler Strukturen. Die automatische…
Expand
2004
2004
Data structures for bandwidth reservations and quality of service on the Internet
A. Nilsson
2004
Corpus ID: 14874980
This thesis deals firstly with ways to solve the problem of limited resource reservations over time, and secondly, handling…
Expand
1999
1999
A Linear Algorithm for Finding Total Colorings of Partial k-Trees
Shuji Isobe
,
Xiaoping Zhou
,
Takao Nishizeki
International Symposium on Algorithms and…
1999
Corpus ID: 18620620
A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, in such a way that no two adjacent or…
Expand
1993
1993
Layout Construction: A Case Study In Algorithm Engineering
G. Frandsen
,
J. Palsberg
,
Erik M. Schmidt
,
Steen Sjøgaard
1993
Corpus ID: 14689665
We design a system for generating newspaper layout proposals. The input to the system consists of editorial information (text…
Expand
1992
1992
Parallel algorithms for control
G. Irwin
1992
Corpus ID: 60791365
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