Deep neural networks have made huge progress in the last few decades.
Ho...
As a relaxation of the clique, a k-plex of a graph is a vertex set that ...
Partial MaxSAT (PMS) and Weighted PMS (WPMS) are two practical
generaliz...
TSP is a classical NP-hard combinatorial optimization problem with many
...
We address Partial MaxSAT (PMS) and Weighted PMS (WPMS), two practical
g...
Nowadays on E-commerce platforms, products are presented to the customer...
We address the Traveling Salesman Problem (TSP), a famous NP-hard
combin...
Stochastic gradient descent (SGD) is a powerful method for large-scale
o...
The maximum k-plex problem is a computationally complex problem, which
e...
We consider a variation of the problem of corruption detection on networ...
Chinese pinyin input methods are very important for Chinese language
pro...
We present our preliminary work to determine if patient's vocal acoustic...