Sciweavers

1088 search results - page 176 / 218
» A Bayesian Approach to Tackling Hard Computational Problems
Sort
View
EDOC
2007
IEEE
15 years 5 months ago
Getting Rid of the OR-Join in Business Process Models
Abstract— In practice, the development of process-aware information systems suffers from a gap between conceptual business process models and executable workflow specifications...
Jan Mendling, Boudewijn F. van Dongen, Wil M. P. v...
86
Voted
SMI
2007
IEEE
139views Image Analysis» more  SMI 2007»
15 years 5 months ago
Texture Atlas Generation for Inconsistent Meshes and Point Sets
In order to compute texture atlases with low stretch and hardly visible texture seams existing texture mapping tools pose high demands on the quality of surface representations li...
Patrick Degener, Reinhard Klein
AAAI
2006
15 years 14 days ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
COMPUTE
2010
ACM
15 years 3 months ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy
AIPS
2008
15 years 1 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...