Unanswered Questions
162 questions with no upvoted or accepted answers
5
votes
0
answers
564
views
Smallest number of rectangles covering marked parts of grid
I have an N by N grid of cells, and certain blocks are marked:
+--+---+---+---+
| | | | |
| | x | x | |
| | x | x | |
| | | | |
| | | | x |
+--+---+---+---+
I would like to ...
- 289
4
votes
0
answers
215
views
Incorporating custom Algorithm in SOLR-LUCENE , before Indexing?
CURRENT FLOW: I am using a custom algorithm(presently in php) to rank
the MYSQL records before INDEXING it to SOLR .
WHAT I WANT : Is it possible implementing this
ALGORITHM(may be in JAVA) inside ...
- 149
3
votes
0
answers
270
views
How do large scale permission systems work with membership expansion?
Let's say you have a permission system with which you can specify things like: user U is a member of group A, which is a subgroup of group B, which is a subgroup of group C, and all members of group C ...
- 170
3
votes
0
answers
153
views
Some "intent"-related questions vis-à-vis Operational Transformation and CRDTs
I’m a little unclear on some questions relating to the "intent" part of concurrent collaboration algorithms (operational transformation and conflict-free replicated data types). Please help!
Strings ...
3
votes
0
answers
247
views
Weighted job scheduling algorithm to minimize load
I have a set of jobs that start by querying an external server for a payload. On receiving the payload, the internal server takes a variable amount of time to complete the job, hence the 'weight'. ...
- 41
3
votes
0
answers
111
views
What's the most practically efficient way to store differences in adjacent matrix values?
I am implementing a certain algorithm that works like this:
Create a closed contour (list) of elements in a matrix, where closed means that the last element is adjacent (by row, column) to the first.
...
- 129
3
votes
0
answers
152
views
Possible to find intersections between a line segment and a disjoint set in log2(n)?
Given a set S of disjoint 2D line segments, is there a way to pre-process S into a data structure that can check if a single arbitrary segment L intersects any segment in S in log2(n) time, as well as ...
- 39
3
votes
0
answers
155
views
Sort numbers into three groups s.t. their sums are close to a certain value
I have a list of numbers (let's call it L) and I need to split this list into three groups (A, B, and C) such that the sum of the numbers in each group (sum(A), sum(B), sum(C)) is as close as possible ...
- 31
3
votes
0
answers
235
views
String Pattern Matching from Lookup Table - Non-Exponential Solution?
Given the problem...
Given a String comprising of non-alhpabetical symbols, and a Lookup
Table where a subset of those symbols may equate to a single
alphabetical character, output all possible ...
- 82.3k
3
votes
0
answers
91
views
How would I identify a gap in a set of curve data, and get its value?
I have a set of 2-D data (x,y) and it produces a set of curves,
and sometimes the set of curves do not overlap, and there is a
distinct separation between the groups of curves, how would I
identify ...
- 20.5k
3
votes
0
answers
162
views
Polygon simplification that encloses original set of points
I have been trying to implement an optimization for 2D sprite rendering to fight the problem of limited fillrate on mobile devices. The idea is to render textured polygons instead of quads that will ...
- 131
3
votes
0
answers
1k
views
Find all paths in a tree type of structure
The language I am using is C#, but I am looking more for help with the algorithm more than I am concerned with which language. I have been trying to develop this algorithm for a while now and I can't ...
- 1,637
3
votes
0
answers
1k
views
Creating a better mouse dragger function
I originally posted this to code review, not knowing incomplete code was off-topic and was pointed to post here. I don't believe this question is a good fit for stack overflow because the code I ...
3
votes
0
answers
72
views
Project a piece of image cut by N-vertex shape to a different N-vertex shape
I have an N-vertex shape that I cut out from an image, and I want to project it onto another shape with the same amount of vertices, but different. So, the image will get changed inside the projection....
- 303
3
votes
0
answers
180
views
Optimizing trigram look ups with wildcards
I am working on creating a spell-checking service for Android (note: this is a platform- and language-neutral question) for Asturian, a minority Romance language. We're using hunspell as the base but ...
CommunityBot
- 1