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.
5
votes
1answer
336 views
Why would I care about the asymptotic growth of the lower bound of the worst case time/space?
In mathematics, there are notations for asymptotic lower bounds, upper bounds, and tight (within-a-constant-factor) bounds. When describing the growth of functions in general, it makes sense that all ...
3
votes
2answers
2k views
OCR - starting point
I really am a starter with OCR, and would like to implement an OCR system. Any pointers on where I can find the introductory material, with the programming kept in mind, like what algorithms or data ...
9
votes
5answers
464 views
How to do TDD for something with many permutations?
When creating a system like an AI, which can take many different paths very quickly, or really any algorithm that has several different inputs, the possible result set can contain a large number of ...
8
votes
6answers
701 views
How do the algorithms to solve problems encountered in interviews translate into real world solutions?
I have recently finished an undergraduate course in computer science and I am looking for a job. During the search I encountered several interesting (and tough) problems that needed clever algorithms ...
7
votes
4answers
375 views
finding houses within a radius
During an interview I was asked given the following: A real estate application that lists all houses that are currently on the market (i.e., for sale) within a given distance (say for example the user ...
5
votes
9answers
1k views
Does object-orientation really affect algorithm performance?
Object orientation has helped me a lot in implementing many algorithms. However, object-oriented languages sometimes guide you in "straightforward" approach and I doubt if this approach is always a ...
5
votes
5answers
364 views
How do I go about data deduplication at scale?
I need to develop, or at least conceptualize a module that does efficient data deduplication. Say we have millions of data records already. Insertion of another 100 mn records, making sure that there ...
5
votes
4answers
681 views
patented algorithm
What does it mean when an algorithm is patented? Am I allowed to use it as long as I am not making money out of it? I am asking because I am working on a project and I happened to discover a feature ...
4
votes
4answers
395 views
Building a route creator
Ok, already up front, I'm going to tell you, that this is a bonus task for Data structure course I'm taking. That should take care of all the questions whether or not this is for a homework.
Route ...
3
votes
1answer
280 views
What is the difference between Quantum annealing and simulated annealing?
In both algorithms objective functions, that will be executed with non quantum computers, are used. Both algorithms are methods for finding the global minimum of a given objective function.
From ...
3
votes
2answers
323 views
Programming interview: on sorted arrays, algorithm proof
The following is a programming interview question: Given 3 sorted arrays. Find(x,y,z), (where x is from 1st array, y is from 2nd array, and z is from 3rd array), such that Max(x,y,z) - Min(x,y,z) is ...
3
votes
2answers
530 views
Product classifying algorithm - text classification - C# - algorithm suggestions
Alright people. Finally with the help of stackoverflow community i have gathered 20 commercial product selling websites product pages with the following features
Product URL
Product Price
Product ...
2
votes
1answer
256 views
Why create a Huffman tree per character instead of a Node?
For a school assignment we're supposed to make a Java implementation of a compressor/decompresser using Huffman's algorithm.
I've been reading a bit about it, specially this C++ tutorial: ...
2
votes
3answers
96 views
Efficient Summary calculation method or approach?
I have an object hierarchy with a number of leaf nodes that will contribute to summary values for the parent object (specifically: project cost and square footage).
What's the most efficient way to ...
2
votes
2answers
389 views
Why hill climbing is called anytime algorithm?
From wikipedia, Anytime algorithm
In computer science an anytime algorithm is an algorithm that can
return a valid solution to a problem even if it's interrupted at any
time before it ends. ...
2
votes
1answer
305 views
Closest location - Heapify or Build-heap
So lets say we have a set of gps data points and your current location. If asked to give the closest point to your current location we can utilize a heap with the distance being the key. Now if we ...
