Sciweavers

3495 search results - page 275 / 699
» On the random satisfiable process
Sort
View
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
16 years 8 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
16 years 7 months ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
CCS
2010
ACM
16 years 2 months ago
Attribute-based signature and its applications
In an attribute-based signature (ABS), users sign messages with any predicate of their attributes issued from an attribute authority. Under this notion, a signature attests not to...
Jin Li, Man Ho Au, Willy Susilo, Dongqing Xie, Kui...
FOCS
2008
IEEE
16 years 1 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
SEMWEB
2007
Springer
16 years 1 months ago
Sampling and Soundness: Can We Have Both?
Recent research on model counting in CNF formulas has shown that a certain sampling method can yield results that are sound with a provably high probability. The key idea is to ite...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...