1058 search results - page 50 / 212 » It's Doomed; We Can Prove It |
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
—We study the localization problem in sparse 3D underwater sensor networks. Considering the fact that depth information is typically available for underwater sensors, we transfor...
ECAI
2004
Springer
14 years 3 months ago
2004
Springer
In this work we further investigate the relation, first found by Truszczy´nski, between modal logic S4F and Default Logic (DL), analyzing some interesting properties and showing ...
IPCO
1992
13 years 11 months ago
1992
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
We start by formulating the resource sharing in peer-to-peer (P2P) networks as a random-matching gift-giving game, where self-interested peers aim at maximizing their own long-ter...
CRYPTO
2012
Springer
12 years 11 days ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...