3415 search results - page 557 / 683 » Lower Bounds for Kernelizations |
144
click to vote
ISTCS
1993
Springer
15 years 8 months ago
1993
Springer
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
215
click to vote
IGIS
1994
15 years 8 months ago
1994
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
140
click to vote
ICALP
1992
Springer
15 years 8 months ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
130
click to vote
SC
1994
ACM
15 years 8 months ago
1994
ACM
The N - body problem is to simulate the motion of N particles under the influence of mutual force fields based on an inverse square law. Greengard's algorithm claims to compu...
176
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...