107 search results - page 17 / 22 » Factor cuts |
COMPGEOM
2009
ACM
14 years 5 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
BMCBI
2007
13 years 11 months ago
2007
Background: Sequence motifs representing transcription factor binding sites (TFBS) are commonly encoded as position frequency matrices (PFM) or degenerate consensus sequences (CS)...
TIP
2010
13 years 9 months ago
2010
In this paper, we propose a generalized linear model for video packet loss visibility that is applicable to different group-of-picture structures. We develop the model using three...
SIGUCCS
2000
ACM
14 years 2 months ago
2000
ACM
In a Collegiate setting, technology must be functional, effective, and highly visible. In the fall of 1999 the CIS department at Bowdoin College saw the need for a greater number ...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...