Sciweavers

1007 search results - page 77 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
WWW
2008
ACM
16 years 3 months ago
Utility-driven load shedding for xml stream processing
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
Mingzhu Wei, Elke A. Rundensteiner, Murali Mani
ECML
2005
Springer
15 years 8 months ago
Active Learning in Partially Observable Markov Decision Processes
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...
Robin Jaulmes, Joelle Pineau, Doina Precup
IEEEPACT
2000
IEEE
15 years 7 months ago
A Lightweight Algorithm for Dynamic If-Conversion during Dynamic Optimization
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
Kim M. Hazelwood, Thomas M. Conte
CATA
2004
15 years 4 months ago
Parallel Thinning on Rmesh
Thinning operation is a fundamental operation in image processing. It is a typical preprocessing stage for pattern recognition and data compression. In this report we proposed an ...
John Jing-Fu Jenq, Wing Ning Li
ESWS
2010
Springer
15 years 6 months ago
Scalable and Parallel Reasoning in the Semantic Web
Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...
Jacopo Urbani