2981 search results - page 470 / 597 » Answer Set Planning |
199
click to vote
SIGMOD
2012
ACM
13 years 8 months ago
2012
ACM
The rise of smartphones equipped with various sensors has enabled personalization of various applications based on user contexts extracted from sensor readings. At the same time i...
205
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
216
click to vote
SDM
2012
SIAM
13 years 8 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
171
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
We briefly survey several privacy compromises in published datasets, some historical and some on paper. An inspection of these suggests that the problem lies with the nature of the...
263
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...