Sciweavers

4526 search results - page 388 / 906
» Algorithmic problems related to the Internet
Sort
View
SODA
2010
ACM
144views Algorithms» more  SODA 2010»
15 years 5 months ago
Cell-Probe Lower Bounds for Succinct Partial Sums
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 ...
Mihai Patrascu, Emanuele Viola
ACL
2010
15 years 4 months ago
An Exact A* Method for Deciphering Letter-Substitution Ciphers
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...
Eric Corlett, Gerald Penn
188
Voted
ASIASIM
2004
Springer
16 years 6 days ago
Design and Implementation of an SSL Component Based on CBD
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...
WWW
2011
ACM
15 years 1 months ago
Learning to rank with multiple objective functions
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...
CVPR
2008
IEEE
16 years 8 months ago
Probabilistic graph and hypergraph matching
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 ...
Ron Zass, Amnon Shashua