Sciweavers

5331 search results - page 296 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
FCT
2003
Springer
15 years 12 months ago
Proving Integrality Gaps without Knowing the Linear Program
: Proving integrality gaps for linear relaxations of NP optimization problems is a difficult task and usually undertaken on a case-by-case basis. We initiate a more systematic app...
Sanjeev Arora
SIAMDM
2010
137views more  SIAMDM 2010»
15 years 5 months ago
Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...
Lara Dolecek, Venkat Anantharam
ICGA
1997
122views Optimization» more  ICGA 1997»
15 years 8 months ago
A Comparison of Global and Local Search Methods in Drug Docking
Molecular docking software makes computational predictions of the interaction of molecules. This can be useful, for example, in evaluating the binding of candidate drug molecules ...
Christopher D. Rosin, R. Scott Halliday, William E...
CERA
2010
105views more  CERA 2010»
15 years 6 months ago
Implications of Alternative Multilevel Design Methods for Design Process Management
Multilevel design problems are typically decomposed into a hierarchy of distributed and strongly coupled sub-problems, each solved by design teams with specialized knowledge and t...
David Shahan, Carolyn Seepersad Seepersad
164
Voted
CVPR
2010
IEEE
15 years 11 months ago
Visual Recognition using Mappings that Replicate Margins
We consider the problem of learning to map between two vector spaces given pairs of matching vectors, one from each space. This problem naturally arises in numerous vision problem...
Lior Wolf, Nathan Manor