Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with algorithms
Search options not deleted
user 147566
An algorithm is a sequence of well-defined steps that defines an abstract solution to a problem. Use this tag when your issue is related to design and analysis of algorithms.
1
vote
2
answers
145
views
Algorithm to generate points uniformly at random from a ball
Consider a 2-dimensional version of generating points in the circumference of a unit radius circle,
independently generate each coordinate uniformly at random from the interval [-1,1].
How to generate …
- 37
0
votes
1
answer
74
views
Difference between paradigm and Algorithm in Machine Learning
Give a class $\mathcal{H}$ of predictors from the set X to $\{0,1\}$. Here each $h \in \mathcal{H}$ is a function from $h: X \longrightarrow \{0,1\}$. The Empirical Risk Minimization is defined as
$$E …
- 37
0
votes
0
answers
37
views
Fastest algorithm for approximate hamming distance
Consider two binary strings of two alphabets of length $l$, to find the hamming distance each corresponding bit needs to be compared. The runtime will be $O(l)$ or simply $l$ many comparisons are req …
- 37
0
votes
Fizz Buzz and pseudo-polynomial time
The runtime of $0/1$ knapsack problem using dynamic programming is $O(nW)$. Now assume that $W = 2^n$, then the runtime of the above algorithm is $O(n2^n)$, which is not a polynomial runtime in $n$. …
- 37