Sciweavers

1723 search results - page 127 / 345
» Cycling in linear programming problems
Sort
View
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
14 years 8 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
ICIP
2001
IEEE
15 years 11 months ago
On sparse signal representations
An elementary proof of a basic uncertainty principle concerning pairs of representations of ?? vectors in different orthonormal bases is provided. The result, slightly stronger th...
Michael Elad, Alfred M. Bruckstein
CP
2003
Springer
15 years 3 months ago
Constraint-Based Optimization with the Minimax Decision Criterion
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
Craig Boutilier, Relu Patrascu, Pascal Poupart, Da...
ACL
2010
14 years 8 months ago
Global Learning of Focused Entailment Graphs
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
Jonathan Berant, Ido Dagan, Jacob Goldberger
ACL
2009
14 years 8 months ago
Recognizing Stances in Online Debates
This paper presents an unsupervised opinion analysis method for debate-side classification, i.e., recognizing which stance a person is taking in an online debate. In order to hand...
Swapna Somasundaran, Janyce Wiebe