4255 search results - page 149 / 851 » Cover |
122
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
151
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
130
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We describe a simple, conceptual forward analysis procedure for complete WSTS S. This computes the clover of a state s0, i.e., a finite description of the closure of the ...
153
click to vote
EWSN
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. Coverage is a very important issue in wireless sensor networks. Current literature defines a point to be covered if it is within the sensing radius of at least one sensor...
145
click to vote
DCC
2008
IEEE
16 years 4 months ago
2008
IEEE
We propose an algorithm which is an improved version of the Kabatiansky-Tavernier list decoding algorithm for the second order binary Reed-Muller code RM(2, m), of length n = 2m , ...