452 search results - page 47 / 91 » A convex optimization approach to the mode acceleration prob... |
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
We propose a linear programming relaxation scheme for the class of multiple object tracking problems where the inter-object interaction metric is convex and the intraobject term q...
ETS
2010
IEEE
13 years 8 months ago
2010
IEEE
It was shown in the past that ATPG based on the Boolean Satisfiability problem is a beneficial complement to traditional ATPG techniques. Its advantages can be observed especially ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Online prediction methods are typically presented as serial algorithms running on a single processor. However, in the age of web-scale prediction problems, it is increasingly comm...
NIPS
2001
13 years 9 months ago
2001
We present a new approach to the supervised learning of lateral interactions for the competitive layer model (CLM) dynamic feature binding architecture. The method is based on con...
ASPDAC
2005
ACM
14 years 1 months ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...