Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In t...
Tong Xiao, Mu Li, Dongdong Zhang, Jingbo Zhu, Ming...
Wirelength estimation techniques typically contain a site density function that enumerates all possible path sites for each wirelength in an architecture and an occupation probabil...
Chung-Kuan Cheng, Andrew B. Kahng, Bao Liu, Dirk S...