633 search results - page 40 / 127 » Locality and Hard SAT-Instances |
AAAI
2000
13 years 11 months ago
2000
Both the Artificial Intelligence (AI) community and the Operations Research (OR) community are interested in developing techniques for solving hard combinatorial problems. OR has ...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
—The main focus of this paper is to present a performance limitation of collaborative spectrum sensing in cognitive radios with imperfect reporting channels. We consider hard dec...
Publication
_2011.jpg "NeuFlow: A Runtime Reconfigurable Dataflow Processor for Vision")
In this paper we present a scalable dataflow hard- ware architecture optimized for the computation of general- purpose vision algorithms—neuFlow—and a dataflow compiler—luaFl...
PAMI
2012
12 years 8 days ago
2012
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
CVPR
2008
IEEE
14 years 12 months ago
2008
IEEE
Object models based on bag-of-words representations can achieve state-of-the-art performance for image classification and object localization tasks. However, as they consider obje...