Sciweavers

GIS
2009
ACM
13 years 9 months ago
LBS (k, T)-anonymity: a spatio-temporal approach to anonymity for location-based service users
We propose a location-based query anonymization technique, LBS (k,T)-anonymization, that ensures anonymity of user's query in a specific time window against what we call know...
Amirreza Masoumzadeh, James Joshi, Hassan A. Karim...
GIS
2009
ACM
13 years 9 months ago
Distortion-based anonymity for continuous queries in location-based mobile services
Privacy preservation has recently received considerable attention for location-based mobile services. Various location cloaking approaches have been proposed to protect the locati...
Xiao Pan, Xiaofeng Meng, Jianliang Xu
ESSLLI
2009
Springer
13 years 9 months ago
Variable Selection in Logistic Regression: The British English Dative Alternation
This paper addresses the problem of selecting the `optimal' variable subset in a logistic regression model for a medium-sized data set. As a case study, we take the British En...
Daphne Theijssen
ESSLLI
2009
Springer
13 years 9 months ago
Can DP Be a Scope Island?
Simon Charlow
ESSLLI
2009
Springer
13 years 9 months ago
POP* and Semantic Labeling Using SAT
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
Martin Avanzini
ESSLLI
2009
Springer
13 years 9 months ago
A Salience-Driven Approach to Speech Recognition for Human-Robot Interaction
We present an implemented model for speech recognition in natural environments which relies on contextual information about salient entities to prime utterance recognition. The hyp...
Pierre Lison
ESSLLI
2009
Springer
13 years 9 months ago
Cdiprover3: A Tool for Proving Derivational Complexities of Term Rewriting Systems
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...
Andreas Schnabl
ECSQARU
2009
Springer
13 years 9 months ago
Can the Minimum Rule of Possibility Theory Be Extended to Belief Functions?
Abstract. When merging belief functions, Dempster rule of combination is justified only when sources can be considered as independent. When dependencies are ill-known, it is usual ...
Sébastien Destercke, Didier Dubois
ECSQARU
2009
Springer
13 years 9 months ago
When in Doubt ... Be Indecisive
For a presented case, a Bayesian network classifier in essence computes a posterior probability distribution over its class variable. Based upon this distribution, the classifier&#...
Linda C. van der Gaag, Silja Renooij, Wilma Steene...