986 search results - page 94 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
117
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
137
Voted
WDAG
2010
Springer
15 years 2 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
124
Voted
VLSID
1994
IEEE
15 years 7 months ago
1994
IEEE
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
136
Voted
APVIS
2008
15 years 5 months ago
2008
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
118
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...