16404 search results - page 576 / 3281 » A set coverage problem |
204
click to vote
COMPGEOM
2010
ACM
16 years 3 days ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
213
click to vote
STOC
2012
ACM
13 years 9 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
178
click to vote
EWSN
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. We examine the problem of tracking dynamic boundaries occurring in natural phenomena using range sensors. Two main challenges of the boundary tracking problem are energy-...
174
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we study the anonymous cardinality estimation problem in radio frequency identification (RFID) systems. To preserve privacy and anonymity, each tag only transmi...
208
click to vote
ICNP
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract—Radio frequency identification (RFID) is a technology where a reader device can “sense” the presence of a closeby object by reading a tag device attached to the obj...