2600 search results - page 87 / 520 » Clustering with or without the Approximation |
106
click to vote
UAI
2008
15 years 2 months ago
2008
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
104
click to vote
VISSYM
2004
15 years 2 months ago
2004
It is difficult for the average viewer to assimilate and comprehend huge amounts of high-dimensional data. It is important to present data in a way that allows the user a high lev...
129
click to vote
FQAS
2009
Springer
15 years 8 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
IMA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In this paper we present a theoretical framework to quantify the information brought by several linear approximations of a blockcipher without putting any restriction on ...
109
click to vote
VMCAI
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...