7123 search results - page 1198 / 1425 » The Ordered Set of Rough Sets |
199
Voted
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
181
click to vote
MOBICOM
2010
ACM
15 years 6 months ago
2010
ACM
In 802.11 managed wireless networks, the manager can address under-served links by rate-limiting the conflicting nodes. In order to determine to what extent each conflicting node ...
199
click to vote
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
146
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
159
click to vote
ALMOB
2007
15 years 6 months ago
2007
Background: Assessing the outcome of motif mining algorithms is an essential task, as the number of reported motifs can be very large. Significance measures play a central role in...