11121 search results - page 323 / 2225 » Computing with Continuous Change |
144
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
341
click to vote
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
We consider the problems of computing aggregation queries in temporal databases, and of maintaining materialized temporal aggregate views efficiently. The latter problem is partic...
153
Voted
WWW
2005
ACM
16 years 5 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
118
click to vote
ICPADS
2005
IEEE
15 years 10 months ago
2005
IEEE
: We discuss a group protocol which supports applications with group communication service when QoS supported by networks or required by applications is changed. An autonomic group...
138
click to vote
VLDB
2004
ACM
15 years 10 months ago
2004
ACM
1 Frequent itemset counting is the first step for most association rule algorithms and some classification algorithms. It is the process of counting the number of occurrences of ...