chaoxu

10 ms·

61.
Ask HN: Domain specific language to implement a calculator
1 points by chaoxu 7y ago|0 comments
62.
by chaoxu 8y ago
How are the 9000 dollars given? Because someone might be in the US under certain visa issues. (For example, OPT, F1, etc).
63.
Ask HN: Service that aggregates personal medical lab reports
1 points by chaoxu 8y ago|0 comments
64.
by chaoxu 8y ago
I use github pages, so I can't gather such statistics.
65.
by chaoxu 8y ago
I now use both Fathom and Google analytics. Most of the time, the only thing I care about is where people come from, and which page gets accessed most often. I feel this should already be enough information for one to understand what is a p
66.
by chaoxu 8y ago
It does not. For faster pseudopolynomial time algorithms to knapsack, see this https://arxiv.org/abs/1802.06440
67.
by chaoxu 8y ago
One of the authors here. Later we showed a much simpler algorithm for the O(u√n) running time. https://chaoxuprime.com/files/papers/subset-sum-simple.pdf We have also prepared a journal version that combines those
68.
Strings with Hamming distance exactly 1(chaoxuprime.com)
1 points by chaoxu 8y ago|0 comments
69.
by chaoxu 8y ago
Indeed, but I want an algorithm with deterministic O(nm) time.
70.
by chaoxu 8y ago
A friend gave me the problem for day 2 part 2, and I found it really cute. Given a set of n strings, each of length m, find if there is a pair that differs in exactly one position. It was not trivial to come up with an optimal and elementar
71.
by chaoxu 8y ago
An interesting theoretical problem that arises: Given a regular language L, define LD(L,k) to be the set of strings with Levenshtein distance at most k from some string in L. 1. Is LD(L,k) regular? (yes) 2. How hard is it to construct a re
72.
by chaoxu 8y ago
Thanks! Do you use that algorithm for anything in your research?
73.
by chaoxu 8y ago
Karger's randomized contraction algorithm for finding a min-cut. It's a common algorithm to introduce students into the world of randomized algorithms. Also a shameless plug. My friend and I came up with this pseudo-polynomial tim
74.
Defeating the Travelling Salesman Problem for Warehouse Logistics (2014)(jobs.zalando.com)
5 points by chaoxu 8y ago|0 comments
75.
by chaoxu 8y ago
I still publish. I joined an industry lab this June. My day to day function is highly non-academic, but we can do academic research on the side (we don't have to). I intend to keep on researching since research is fun. But writing itse
76.
by chaoxu 8y ago
It does not look good, and black causes ghosting.
77.
by chaoxu 8y ago
Did you eventually switch the panel to ES133UT2? Dasung released a new version called paperlike HD (also called paperlike 3). In that version, it does not look like having a glass panel.
78.
by chaoxu 8y ago
I don't have an easy way to measure the FPS, but here is a video I just took. https://www.youtube.com/watch?v=xW-gatdEC7w It is reasonable enough to see what's happening, but obviously, I'm not going to watch
79.
by chaoxu 8y ago
1. Currently, I use it for writing code and reading papers. However, I still want the monitor to be a good enough drop-in monitor for things I need to occasionally do. For example, I need to switch to a browser window to check what was that
80.
by chaoxu 8y ago
Recently, I brought a Dasung paperlike HD to use as a monitor. (crazy expensive, prob should've spend money elsewhere...) I thought some things were impossible with eink, but it proved me wrong. (video in a reasonable fps) It has a few
81.
by chaoxu 8y ago
It is unclear what is the objective. Minimize deadhead costs? If so, solving it with min-cost circulation with lower-bound. It would be much cleaner.
82.
Subset Sum Made Simple(arxiv.org)
7 points by chaoxu 8y ago|0 comments
83.
by chaoxu 8y ago
The link for algorithms engineer was removed. Did it just got satisfied?
84.
How to transition from academia to data science(cj2001.github.io)
2 points by chaoxu 9y ago|0 comments
85.
The Shortest Kinship Description Problem [pdf](chaoxu3.web.engr.illinois.edu)
2 points by chaoxu 9y ago|0 comments
86.
by chaoxu 10y ago
I do see this kind of behavior in engineering oriented fields. Maybe the authors try to be as formal as possible, but doesn't known when to stop? Or maybe this is how they naturally think? (I doubt this, but because this is so common,
87.
by chaoxu 10y ago
"intuitionistically" refers to the intuitionistic logic.
88.
Tickeys: Instant audio feedback for typing(github.com)
1 points by chaoxu 10y ago|0 comments
89.
by chaoxu 10y ago
That map is doing an impure operation. The order of application matters. Otherwise, for people who learned functional programming from the start, it's much easier to understand.
90.
by chaoxu 10y ago
I have 2, through Neil Calkin.

More ›