6110 search results - page 174 / 1222 » Approximate Computing |
237
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
157
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
176
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
158
click to vote
DIS
2007
Springer
16 years 19 days ago
2007
Springer
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
203
click to vote
TAMC
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...