102 search results - page 10 / 21 » VDCBPI: an Approximate Scalable Algorithm for Large POMDPs |
163
click to vote
AI
2011
Springer
14 years 5 months ago
2011
Springer
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
215
click to vote
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
126
Voted
RCIS
2010
15 years 7 days ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
137
Voted
CIKM
2010
Springer
15 years 13 days ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
106
click to vote
DATAMINE
2006
15 years 1 months ago
2006
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...