3415 search results - page 63 / 683 » Lower Bounds for Kernelizations |
70
Voted
ICRA
2010
IEEE
14 years 11 months ago
2010
IEEE
— Cable robots have seen considerable recent interest ensuing from their ability to combine a large workspace with significant payload capacity. However, the cables can apply for...
124
Voted
SPAA
2004
ACM
15 years 6 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
92
Voted
IANDC
2006
15 years 21 days ago
2006
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
100
Voted
TOC
2008
15 years 17 days ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
110
Voted
AIML
2004
15 years 2 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...