Sciweavers

1289 search results - page 209 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
15 years 10 months ago
A constant-factor approximation for stochastic Steiner forest
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
Anupam Gupta, Amit Kumar
CADE
2006
Springer
15 years 10 months ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
15 years 10 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
ICDE
2010
IEEE
235views Database» more  ICDE 2010»
15 years 9 months ago
Cost-efficient and Differentiated Data Availability Guarantees in Data Clouds
Abstract-- Failures of any type are common in current datacenters. As data scales up, its availability becomes more complex, while different availability levels per application or ...
Nicolas Bonvin, Thanasis G. Papaioannou, Karl Aber...
MOBIHOC
2008
ACM
15 years 9 months ago
P2P-based routing and data management using the virtual cord protocol (VCP)
We present Virtual Cord Protocol (VCP), a virtual relative position based routing protocol for sensor networks that also provides methods for data management as known from standar...
Abdalkarim Awad, Reinhard German, Falko Dressler