727 search results - page 70 / 146 » Private approximation of search problems |
OPODIS
2004
13 years 11 months ago
2004
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
ICDE
2010
IEEE
14 years 9 months ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
WSDM
2009
ACM
14 years 4 months ago
2009
ACM
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
Many existing human detection systems are based on sub-window classification, namely detection is done by enumerating rectangular sub-images in the 2D image space. Detection rate...
ICDE
2007
IEEE
14 years 1 months ago
2007
IEEE
The problem of trajectory similarity in moving object databases is a relatively new topic in the spatial and spatiotemporal database literature. Existing work focuses on the spati...