117 search results - page 11 / 24 » Query suggestion using hitting time |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
ESA
2007
Springer
14 years 27 days ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
DEXA
2004
Springer
14 years 3 days ago
2004
Springer
Abstract. In relational database management systems indexes are used to accelerate specific queries. The selection of indexes is an important task when tuning a database which is ...
SIGMOD
2006
ACM
14 years 6 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
PETRA
2010
ACM
13 years 8 months ago
2010
ACM
We study the performance of three dynamic programming methods on music retrieval. The methods are designed for time series matching but can be directly applied to retrieval of mus...