4526 search results - page 118 / 906 » Algorithmic problems related to the Internet |
134
click to vote
SPIRE
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
123
click to vote
COLT
1997
Springer
15 years 8 months ago
1997
Springer
We relate two problems that have been explored in two distinct communities. The first is the problem of combining expert advice, studied extensively in the computational learning...
154
click to vote
LION
2007
Springer
15 years 10 months ago
2007
Springer
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
ESWS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract When creating Semantic Web data, users have to make a critical choice for a vocabulary: only through shared vocabularies can meaning be established. A centralised policy p...
190
click to vote
STOC
2000
ACM
15 years 8 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...