| 
|
Group: algorithms
topics >
algorithmic complexity analysis
Topic:
computational geometry
Topic:
graph coloring
Topic:
numerical error
Topic:
probabilistic and randomized algorithms
Topic:
sort algorithms
mathematics
Topic:
automatic selection of algorithm for abstract data type
Topic:
parallel algorithms
Topic:
programming as mathematics
Topic:
real numbers and floating point numbers
Topic:
search algorithms
Topic:
string operations
Subtopic: approximation algorithms
Quote: an on-line/off-line digital signature has a slow, off-line step prior to selecting the message, and a fast, on-line step with the message [»micaS2_2002]
Subtopic: time series analysis
Quote: design and analysis of approximation algorithms by the local ratio technique; simple and elegant, like primal-dual; typically uses a weight function; e.g., 2OPT vertex cover [»baryR12_2004]
Quote: time series analysis should be linear in time and sublinear in space; use data reduction/transformation, indexing methods, and flexible similarity searching
[»shasD_2004]
Topic: algorithmic complexity analysis (10 items)
Topic: computational geometry (20 items)
Topic: graph coloring (7 items)
Topic: numerical error (19 items)
Topic: probabilistic and randomized algorithms (11 items)
Topic: sort algorithms
(24 items)
Group: mathematics (23 topics, 560 quotes) Topic: automatic selection of algorithm for abstract data type (7 items)
Topic: parallel algorithms (15 items)
Topic: programming as mathematics (27 items)
Topic: real numbers and floating point numbers (37 items)
Topic: search algorithms (40 items)
Topic: string operations
(20 items)