graphcolorer

3 ms·

1.
by graphcolorer 3mo ago
Interestingly, the paper says that the glyph to phoneme conversion is lossy for Hindi (Devanagari) script due to schwa deletion, so one of the key innovations here is that the Sanskrit is first transliterated into Kannada before TTS.
2.
by graphcolorer 7mo ago
I like this part very much: More than three years after this episode took place, Terence, still a little boy, happily played hide and seek with his two younger brothers when the Tao family visited the Clements household. He is a happy, well
3.
by graphcolorer 2y ago
An important character in the great Hindu epic, the Mahabharata, likely had this condition. She was the great-grandmother of the Pandavas and Kauravas and her name was Satyavati. She was also known as Matsyagandhi ("fish-fragrant"
4.
by graphcolorer 5y ago
No, though nodes can be deleted -- at a cost equal to the total cost of all the edges that contain it.
5.
by graphcolorer 5y ago
That's what I'm doing now, but the results aren't great. If there's a way to estimate a lower bound on the number of edges to remove, I can figure out if the results aren't great because of the approximation, or bec
6.
by graphcolorer 5y ago
Can take as long as needed as it only needs to be colored one time. About 10,000 nodes, reasonably dense (about half the nodes will have 1,000+ edges).
7.
by graphcolorer 5y ago
One time.
8.
by graphcolorer 5y ago
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