371 search results - page 44 / 75 » Computation of the Minimal Associated Primes |
CVPR
2008
IEEE
13 years 11 months ago
2008
IEEE
We consider the problem of visual categorization with minimal supervision during training. We propose a partbased model that loosely captures structural information. We represent ...
TPDS
1998
13 years 9 months ago
1998
—Coordinated checkpointing simplifies failure recovery and eliminates domino effects in case of failures by preserving a consistent global checkpoint on stable storage. However, ...
JMLR
2010
13 years 8 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
CLOUDCOM
2010
Springer
13 years 7 months ago
2010
Springer
Abstract--Commercial services for provisioning software components and virtual infrastructure in the cloud are emerging. For customers, this creates a multitude of possibilities fo...
JGO
2010
13 years 4 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...