2107 search results - page 16 / 422 » Computing Small Search Numbers in Linear Time |
TCS
2011
13 years 2 months ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
JMLR
2006
13 years 7 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
IPCCC
2005
IEEE
14 years 1 months ago
2005
IEEE
A number of science applications employing collaborative computations require transport methods that guarantee end-to-end performance at the application level. Throughputs achieve...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
In this paper, we consider the problem of stereo matching using loopy belief propagation. Unlike previous methods which focus on the original spatial resolution, we hierarchically...
IMA
2007
Springer
14 years 1 months ago
2007
Springer
Non-linear cryptanalysis is a natural extension to Matsui’s linear cryptanalitic techniques in which linear approximations are replaced by nonlinear expressions. Non-linear appro...