Sciweavers

CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 11 months ago
Optimal Path Planning under Temporal Logic Constraints
Abstract-- In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the en...
Stephen L. Smith, Jana Tumova, Calin Belta, Daniel...
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 11 months ago
Bin Packing via Discrepancy of Permutations
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
Friedrich Eisenbrand, Dömötör P&aac...
CORR
2010
Springer
79views Education» more  CORR 2010»
13 years 11 months ago
A Multi-hop Multi-source Algebraic Watchdog
In our previous work (`An Algebraic Watchdog for Wireless Network Coding'), we proposed a new scheme in which nodes can detect malicious behaviors probabilistically, police th...
MinJi Kim, Muriel Médard, João Barro...
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 11 months ago
Parameterizing by the Number of Numbers
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
Michael R. Fellows, Serge Gaspers, Frances A. Rosa...
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 11 months ago
On Flat Polyhedra deriving from Alexandrov's Theorem
We show that there is a straightforward algorithm to determine if the polyhedron guaranteed to exist by Alexandrov's gluing theorem is a degenerate flat polyhedron, and to re...
Joseph O'Rourke
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 11 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
CORR
2010
Springer
131views Education» more  CORR 2010»
13 years 11 months ago
Multimode Control Attacks on Elections
In 1992, Bartholdi, Tovey, and Trick [1992] opened the study of control attacks on elections--attempts to improve the election outcome by such actions as adding/deleting candidate...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 11 months ago
Discrete denoising of heterogenous two-dimensional data
We consider discrete denoising of two-dimensional data with characteristics that may be varying abruptly between regions. Using a quadtree decomposition technique and space-fillin...
Taesup Moon, Tsachy Weissman, Jae-Young Kim
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 11 months ago
Can Random Coin Flips Speed Up a Computer?
David Zuckerman
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 11 months ago
Submodular Maximization by Simulated Annealing
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
Shayan Oveis Gharan, Jan Vondrák