A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
The wide availability of commodity graphics processors has made real-time graphics an intrinsic component of the human/computer interface. These graphics cores accelerate the z-bu...
In this study, a novel multidimensional time series classification technique, namely support feature machine (SFM), is proposed. SFM is inspired by the optimization model of suppo...
Wanpracha Art Chaovalitwongse, Ya-Ju Fan, Rajesh C...
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...