Sciweavers

98 search results - page 5 / 20
» Achieving anonymity via clustering
Sort
View
MOBIQUITOUS
2007
IEEE
14 years 5 months ago
Towards Scalable and Robust Service Discovery in Ubiquitous Computing Environments via Multi-hop Clustering
Abstract— Large-scale ubiquitous computing environments require scalable and robust service discovery to enable “anytime, anywhere” computing, which is hard to be satisfied ...
Wei Gao
CCS
2007
ACM
14 years 5 months ago
Preserving privacy in gps traces via uncertainty-aware path cloaking
Motivated by a probe-vehicle based automotive traffic monitoring system, this paper considers the problem of guaranteed anonymity in a dataset of location traces while maintainin...
Baik Hoh, Marco Gruteser, Hui Xiong, Ansaf Alrabad...
WSC
2007
14 years 1 months ago
Real-time prediction in a stochastic domain via similarity-based data-mining
This paper introduces an application and a methodology to predict future states of a process under real-time requirements. The real-time functionality is achieved by creating a Ba...
Timo Steffens, Philipp Hügelmeyer
WWW
2010
ACM
14 years 5 months ago
CETR: content extraction via tag ratios
We present Content Extraction via Tag Ratios (CETR) – a method to extract content text from diverse webpages by using the HTML document’s tag ratios. We describe how to comput...
Tim Weninger, William H. Hsu, Jiawei Han
PERVASIVE
2011
Springer
13 years 1 months ago
Identifying Important Places in People's Lives from Cellular Network Data
People spend most of their time at a few key locations, such as home and work. Being able to identify how the movements of people cluster around these “important places” is cru...
Sibren Isaacman, Richard Becker, Ramón C&aa...