Sciweavers

1379 search results - page 139 / 276
» The Complexity of the Annihilating Polynomial
Sort
View
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 6 months ago
Guessing Facets: Polytope Structure and Improved LP Decoder
Abstract--We investigate the structure of the polytope underlying the linear programming (LP) decoder introduced by Feldman, Karger, and Wainwright. We first show that for expander...
Alexandros G. Dimakis, Martin J. Wainwright
JAIR
2006
87views more  JAIR 2006»
15 years 6 months ago
Fault Tolerant Boolean Satisfiability
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
Amitabha Roy
DAM
2007
120views more  DAM 2007»
15 years 6 months ago
Advances on sorting by reversals
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
Eric Tannier, Anne Bergeron, Marie-France Sagot
CVPR
2003
IEEE
16 years 8 months ago
An Efficient Solution to the Five-Point Relative Pose Problem
An efficient algorithmic solution to the classical five-point relative pose problem is presented. The problem is to find the possible solutions for relative camera motion between ...
David Nistér
ICIP
2005
IEEE
16 years 8 months ago
Fourier transform for the spatial quincunx lattice
We derive a new, two-dimensional nonseparable signal transform for computing the spectrum of spatial signals residing on a finite quincunx lattice. The derivation uses the connect...
Markus Püschel, Martin Rötteler