986 search results - page 85 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
115
Voted
ESA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (th...
128
click to vote
ALT
2008
Springer
16 years 17 days ago
2008
Springer
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...
122
Voted
COLT
1999
Springer
15 years 8 months ago
1999
Springer
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...
121
Voted
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
116
Voted
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...