The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...
So far, many researches have been done to develop efficient music retrieval systems, and query-by-humming has been considered as one of the most intuitive and effective query meth...
While much research has been performed on query logs collected for major Web search engines, query log analysis to enhance search on smaller and more focused collections has attrac...
Stephen Dignum, Udo Kruschwitz, Maria Fasli, Yunhy...
DHT is a widely used building block for scalable P2P systems. However, as uniform hashing employed in DHTs destroys data locality, it is not a trivial task to support complex queri...
While much recent research has focussed on extending databases beyond the traditional relational model, relatively little has been done to develop database tools for querying data...