I have a graph with weighted edges. I want to remove edges to make the graph colorable with N colors (e.g. N=40) such that the total weight of removed edges is minimized. If I'm able to solve this problem, that will complete a project I've been working on for years now to make a working keyboard for a person I know that has cerebral palsy.
Will the graph ever change? Is this a one-time computation?
Ask HN: What problem are you close to solving and how can we help?
311–320 of 486 posts
Re: Ask HN: What problem are you close to solving and how can we help?
#312I have a graph with weighted edges. I want to remove edges to make the graph colorable with N colors (e.g. N=40) such that the total weight of removed edges is minimized. If I'm able to solve this problem, that will complete a project I've been working on for years now to make a working keyboard for a person I know that has cerebral palsy.
What are the needs in time?
Re: Ask HN: What problem are you close to solving and how can we help?
#313Earlier quoted context omitted.
Wow, this sounds very ambitious! Perhaps you could somehow attach the piezoelectric component or bars to a micrometer [1] which is designed for accurate and repeatable measurement? [1] https://en.wikipedia.org/wiki/Micrometer
Yes, I could. I believe the most straight forward design would be 3 micrometers directly supporting the piezoelectric component, with no levers. Yet, they are a bit expensive. I'm still not willing to budget all that, but I'm starting to consider it.
[1] https://www.aliexpress.com/wholesale?catId=0&initiative_id=S...
Re: Ask HN: What problem are you close to solving and how can we help?
#314I'm working on a different type of compression (for all file types). I am able to to get in the 10-20% range, but the speed to compress is to slow many times, or the compression doesnt complete at other times (I've been working on this for years). My personal website: http://danclark.org I'm also working on a conversational search engine (using NLP) at http://supersmart.ai
Have you looked into Middle Out compression?
Re: Ask HN: What problem are you close to solving and how can we help?
#315I'm trying to make social media moderation more democratic and using that to decide fuzzy questions like "should this post be censored", or "is this misleading" [0]. While the crowd's answer won't be perfect it will help sort through a lot of the noise and feel better than the decision of whatever mod happened to create the subreddit. The problem: how can I make decisions based on a sample with a binary question. I t…
I got it to a decent state, but didn’t know how to propagate it or inject it into social communities. I wanted people to be able to tag it on Facebook, and it would reply with an informational card with the analysis and summary.
Re: Ask HN: What problem are you close to solving and how can we help?
#316I want to improve parts of online professional networking, specifically to be more about self-mentoring/shared learning, as opposed to sales connections. This is ever more important with the onset of remote hiring, remote work, and the isolation/depersonalization it brings to newcomers to the industry. There's also an "evil" momentum in remote hiring -- some companies _need_ asynchronous interviews to support their s…
One feedback about the homepage: show a few examples of how people have answered questions, below the prompt. That's more helpful to get us thinking about our own answers, compared to a blank field. (Also, it's not clear what the percentages are meant to represent there. And I'm guessing the number next to the edit icon shows how many people have answered the question already? May need some UI tweaks on these.)
Re: Ask HN: What problem are you close to solving and how can we help?
#317I have a graph with weighted edges. I want to remove edges to make the graph colorable with N colors (e.g. N=40) such that the total weight of removed edges is minimized. If I'm able to solve this problem, that will complete a project I've been working on for years now to make a working keyboard for a person I know that has cerebral palsy.
Similar to what another commenter said about time, have you tried a backtracking approach by: (1) coloring the whole graph (let's say you end with 42 colors) (2) start with the highest colored nodes (e.g. N=42, which exceeds your threshold of 40) and (3) greedily remove the lowest-weight edges (or maybe, edges to other high-colored nodes) until you are either all colored with 40 colors or we reach an invalid state (i…
Re: Ask HN: What problem are you close to solving and how can we help?
#318Low code for devs. https://github.com/hofstadter-io/hof
Trying to reduce redundant tasks and simplify changes with minimal effort.
Re: Ask HN: What problem are you close to solving and how can we help?
#319I have a pile of mp3s and want to splice them together with a single ffmpeg operation. Essentially injecting multiple small audio files into a large one using time codes. I know there's got to be a way to do it, but I have yet to find a way to do it in a single operation instead of multiple passes.
https://superuser.com/questions/587511/concatenate-multiple-...
Re: Ask HN: What problem are you close to solving and how can we help?
#320Web site building complexity, for now I started with a simple static site generator https://mkws.sh/ . Right now, I'm not using any package manager, no config files, only one language for templates (sh), and obviously HTML, CSS, Js. I eventually plan to develop a simple CMS based on the same ideas. Ideas and code are welcome!
> (sh), and obviously HTML, CSS, Js Cut out the sh dependency and just use the "obvious" tech; make the site capable of generating itself, without reliance on any other tools.