The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
Letter-substitution ciphers encode a document from a known or hypothesized language into an unknown writing system or an unknown encoding of a known writing system. It is a proble...
Abstract. SSL is one of the most popular protocols used on the Internet for secure communications. However SSL protocol has several problems. First, SSL protocol brings considerabl...
Eun-Ae Cho, Young-Gab Kim, Chang-Joo Moon, Doo-Kwo...
We investigate the problem of learning to rank for document retrieval from the perspective of learning with multiple objective functions. We present solutions to two open problems...
Krysta Marie Svore, Maksims Volkovs, Christopher J...
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...