306 search results - page 30 / 62 » Mining tree queries in a graph |
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
BMCBI
2006
13 years 8 months ago
2006
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
KDD
1995
ACM
13 years 11 months ago
1995
ACM
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...