We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Exploratory ad-hoc queries could return too many answers ? a phenomenon commonly referred to as "information overload". In this paper, we propose to automatically catego...
Abstract. An important goal of security in information systems is confidentiality. A confidentiality policy specifies which users should be forbidden to acquire what kind of inform...
Abstract. We present a new learning to rank framework for estimating context-sensitive term weights without use of feedback. Specifically, knowledge of effective term weights on ...
Regular path queries (RPQs), expressed as regular expressions over the alphabet of database edge-labels, are commonly used for guided navigation of graph databases. While convenie...