841 search results - page 147 / 169 » Approximability of Minimum AND-Circuits |
126
click to vote
FOCS
2008
IEEE
15 years 10 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...
141
click to vote
HICSS
2008
IEEE
15 years 10 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
150
click to vote
AINA
2007
IEEE
15 years 10 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
152
click to vote
INFOCOM
2007
IEEE
15 years 10 months 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...
136
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...