Sciweavers

221 search results - page 38 / 45
» Frugal Sensor Assignment
Sort
View
MOBIHOC
2006
ACM
14 years 7 months ago
DRAND: : distributed randomized TDMA scheduling for wireless ad-hoc networks
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
Injong Rhee, Ajit Warrier, Jeongki Min, Lisong Xu
IDEAS
2008
IEEE
256views Database» more  IDEAS 2008»
14 years 2 months ago
WIDS: a sensor-based online mining wireless intrusion detection system
This paper proposes WIDS, a wireless intrusion detection system, which applies data mining clustering technique to wireless network data captured through hardware sensors for purp...
Christie I. Ezeife, Maxwell Ejelike, Akshai K. Agg...
ICML
2006
IEEE
14 years 8 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis
PAKDD
2009
ACM
103views Data Mining» more  PAKDD 2009»
14 years 2 months ago
Hot Item Detection in Uncertain Data
Abstract. An object o of a database D is called a hot item, if there is a sufficiently large population of other objects in D that are similar to o. In other words, hot items are ...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
AIPR
2008
IEEE
14 years 2 months ago
Temporal structure methods for image-based change analysis
– This paper addresses the exploitation of massive numbers of image-derived change detections. We use the term “change analysis” to emphasize the intelligence value obtained ...
Ray Rimey, Dan Keefe