33 search results - page 7 / 7 » Complexity of terminating preference elicitation |
ICDE
2002
IEEE
14 years 6 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
In a mobile service scenario, users query a server for nearby points of interest but they may not want to disclose their locations to the service. Intuitively, location privacy may...
JELIA
2010
Springer
13 years 2 months ago
2010
Springer
Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the t...