23 search results - page 2 / 5 » Decomposition and Construction of Neighbourhood Operations U... |
139
click to vote
TPHOL
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we present an approach to describe uniformly iterated “big” operations, like Pn i=0 f(i) or maxi∈I f(i) and to provide lemmas that encapsulate all the commonly...
145
click to vote
ALGORITHMICA
2006
15 years 5 months ago
2006
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
165
click to vote
ICML
2006
IEEE
16 years 6 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
172
click to vote
VMCAI
2010
Springer
16 years 11 days ago
2010
Springer
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logi...
164
click to vote
DAM
2010
15 years 5 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...