Sciweavers

3656 search results - page 254 / 732
» Compact Location Problems
Sort
View
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
16 years 3 months ago
Tracking User Mobility to Detect Suspicious Behavior.
Popularity of mobile devices is accompanied by widespread security problems, such as MAC address spoofing in wireless networks. We propose a probabilistic approach to temporal an...
Gaurav Tandon, Philip K. Chan
TAMC
2009
Springer
16 years 1 months ago
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
Priced Probabilistic Timed Automata (PPTA) extend timed automata with cost-rates in locations and discrete probabilistic branching. The model is a natural combination of Priced Tim...
Jasper Berendsen, Taolue Chen, David N. Jansen
CISS
2008
IEEE
16 years 28 days ago
Optimizing wireless networks for heterogeneous spatial loads
—Large-scale wireless networks must be designed such that there are no gaps in coverage. It is also desirable to minimize the number of access points used in order to minimize th...
Balaji Rengarajan, Gustavo de Veciana
CISS
2007
IEEE
16 years 24 days ago
An EM Technique for Multiple Transmitter Localization
— We propose an expectation-maximization (EM) technique for locating multiple transmitters based on power levels observed by a set of arbitrarily-placed receivers. Multiple trans...
Jill K. Nelson, Maya R. Gupta
ICDM
2007
IEEE
119views Data Mining» more  ICDM 2007»
16 years 24 days ago
Reducing UK-Means to K-Means
This paper proposes an optimisation to the UK-means algorithm, which generalises the k-means algorithm to handle objects whose locations are uncertain. The location of each object...
Sau Dan Lee, Ben Kao, Reynold Cheng