CIAC
2006
Springer
14 years 3 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
CCS
2006
ACM
14 years 3 months ago
2006
ACM
In-network aggregation is an essential primitive for performing queries on sensor network data. However, most aggregation algorithms assume that all intermediate nodes are trusted...
DIALM
2004
ACM
14 years 3 months ago
2004
ACM
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
DIALM
2004
ACM
14 years 3 months ago
2004
ACM
We study the problem of providing a sensor node with an accurate estimate of the current time, from a novel prospective which is complementary to the well
COOPIS
2004
IEEE
14 years 3 months ago
2004
IEEE
Publish/subscribe middleware provides efficient support for loosely coupled communication in distributed systems. A number of different distributed message-filtering algorithms hav...
ATAL
2006
Springer
14 years 3 months ago
2006
Springer
We address the problem of learning in repeated N-player (as opposed to 2-player) general-sum games. We describe an extension to existing criteria focusing explicitly on such setti...
ATAL
2006
Springer
14 years 3 months ago
2006
Springer
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
We study the compression of polynomially samplable sources. In particular, we give efficient prefix-free compression and decompression algorithms for three classes of such sources ...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...