Sciweavers

CORR
2010
Springer
38views Education» more  CORR 2010»
13 years 8 months ago
Ranking with Submodular Valuations
Yossi Azar, Iftah Gamzu
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 8 months ago
Heapable Sequences and Subsequences
John W. Byers, Brent Heeringa, Michael Mitzenmache...
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 8 months ago
Nonuniform Sparse Recovery with Gaussian Matrices
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as 1-minimization find the sparse...
Ulas Ayaz, Holger Rauhut
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 8 months ago
Is Content Publishing in BitTorrent Altruistic or Profit-Driven
BitTorrent is the most popular P2P content delivery application where individual users share various type of content with tens of thousands of other users. The growing popularity ...
Rubén Cuevas Rumín, Michal Kryczka, ...
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 8 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 8 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 8 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 8 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 8 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 8 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...