30 search results - page 4 / 6 » The probabilistic analysis of a greedy satisfiability algori... |
WSC
2004
13 years 8 months ago
2004
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specific...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
AAAI
2006
13 years 8 months ago
2006
Learning application-specific distance metrics from labeled data is critical for both statistical classification and information retrieval. Most of the earlier work in this area h...
ICDT
2005
ACM
14 years 29 days ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...