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 134583
In mathematics and computer science, an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function. Algorithms are used for calculation, data processing, and automated reasoning.
0
votes
Which algorithms do I need to look into?
This just comes to my mind as I was working with a different problem.
When I came back I realized that Falk Huffner has already mentioned the tip.
Anyway, no more fingering, one can show the reductio …
- 3,021
1
vote
Find points whose pairwise distances approximate a given distance matrix
There seems to be a very simple solution here. (edited)
Set the coordinates of each point to be (x_i, y_i, z_i)
Form a system of quadratic equations according to the distance matrix.
For each equatio …
- 3,021
1
vote
Concept for dealing with recurring appointments
I would like to offer you my solution for this by recognizing that:
All appointments, single or re-occurring, have at least a date
Under reasonable settings, re-occurring appointments often have a p …
- 3,021
3
votes
Accepted
How to convert this recursive problem to iterative? Line Simplification algorithm fails to r...
I would simulate in the most generic way as follows:
This is what I believe the low-level machine would do.
func(Param x) {
Stack stack = new Stack();
Frame frame = new Frame(x);
push(frame);
…
- 3,021
2
votes
How to quickly search through a very large list of strings / records on a database
Just in case you missed it. If you use Lucene for your database instead of in-DB supported text search, you will have to be extremely careful when making modification to your DB. How do you make sure …
- 3,021
1
vote
Tournament bracket method to put distance between teammates
I hope this has a proof built into itself.
The main idea is to delay the meeting of 2 teammates as much as possible.
So a greedy algorithm would work.
The most we can delay is in the final, then sem …
- 3,021
1
vote
NLP - Queries using semantic wildcards in full text searching, maybe with Lucene?
As you use the terms NP and VP, I think you are talking about syntactic, not semantic. There are differences between the two.
You can check out dependency grammar to see how it is different from CFG s …
- 3,021
0
votes
Architecture strategies for a complex competition scoring system
Here are my thoughts about this system.
The number of scoring elements seems to be very large and I tend to see that they are independent of each other (if not, you need to think about pre-process y …
- 3,021