269 search results - page 53 / 54 » A branch and bound method for stochastic global optimization |
107
click to vote
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
In this paper, we present an event parsing algorithm based on Stochastic Context Sensitive Grammar (SCSG) for understanding events, inferring the goal of agents, and predicting th...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
ML
1998
ACM
14 years 9 months ago
1998
ACM
Recent algorithmic and theoretical advances in reinforcement learning (RL) have attracted widespread interest. RL algorithmshave appeared that approximatedynamic programming on an ...
BMCBI
2008
14 years 9 months ago
2008
Background: Microarray pre-processing usually consists of normalization and summarization. Normalization aims to remove non-biological variations across different arrays. The norm...
ICCAD
2006
IEEE
15 years 6 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...