2520 search results - page 285 / 504 » The complexity of approximating entropy |
130
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
164
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
161
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
175
click to vote
INFOCOM
2007
IEEE
16 years 27 days ago
2007
IEEE
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
195
click to vote
INFOCOM
2007
IEEE
16 years 27 days ago
2007
IEEE
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...