3415 search results - page 506 / 683 » Lower bounds on kernelization |
159
click to vote
GRID
2007
Springer
15 years 10 months ago
2007
Springer
We propose strategies to efficiently execute a query workload, which consists of multiple related queries submitted against a scientific dataset, on a distributed-memory system in...
161
Voted
ESA
2008
Springer
15 years 8 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
164
click to vote
AAAI
2010
15 years 7 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
142
click to vote
NIPS
2007
15 years 7 months ago
2007
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
172
click to vote
SIROCCO
2007
15 years 7 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...