493 search results - page 82 / 99 » Quantum Query Complexity of Some Graph Problems |
103
click to vote
PODS
2006
ACM
15 years 9 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
200
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract-- Scientific workflow management systems are increaingly providing the ability to manage and query the provenance of data products. However, the problem of differencing th...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
86
Voted
AAAI
2011
13 years 9 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
FLAIRS
2004
14 years 11 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...