4894 search results - page 765 / 979 » The Guarding Problem - Complexity and Approximation |
122
Voted
TCOM
2010
15 years 1 months ago
2010
Abstract—This paper considers an uplink time division multiple access (TDMA) cognitive radio network where multiple cognitive radios (secondary users) attempt to access a spect...
121
Voted
TKDE
2010
15 years 1 months ago
2010
—Duplicates in data streams may often be observed by the projection on a subspace and/or multiple recordings of objects. Without the uniqueness assumption on observed data elemen...
135
Voted
ADHOCNOW
2010
Springer
15 years 20 days ago
2010
Springer
A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensor...
123
Voted
CIKM
2010
Springer
15 years 20 days ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
122
Voted
ICDM
2010
IEEE
15 years 18 days ago
2010
IEEE
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...