986 search results - page 84 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
136
Voted
JGAA
2006
15 years 3 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
102
Voted
SPDP
1991
IEEE
15 years 7 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
140
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
102
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
103
Voted
ALT
2008
Springer
16 years 17 days ago
2008
Springer
In this paper, we initiate a theoretical study of the problem of clustering data under interactive feedback. We introduce a query-based model in which users can provide feedback to...