1743 search results - page 310 / 349 » Generalized Modal Satisfiability |
SACMAT
2009
ACM
14 years 4 months ago
2009
ACM
We develop the foundations for a theory of Group-Centric Secure Information Sharing (g-SIS), characterize a specific family of models in this arena and identify several direction...
SIGECOM
2009
ACM
14 years 4 months ago
2009
ACM
We study protocols to enable one user (the principal) to make potentially profitable but risky interactions with another user (the agent), in the absence of direct trust between ...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
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 ...
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
— Many tasks require multiple sensing capabilities; in Wireless Sensor Networks (WSN), it is expensive to deploy a homogeneous network wherein every sensor has the same functiona...