87 search results - page 8 / 18 » Solving large Steiner Triple Covering Problems |
108
click to vote
EOR
2010
14 years 9 months ago
2010
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
109
click to vote
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
93
Voted
PDCN
2004
15 years 1 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
LREC
2010
15 years 1 months ago
2010
Although the Semantic web is steadily gaining in popularity, it remains a mystery to a large percentage of Internet users. This can be ed to the complexity of the technologies tha...
90
Voted
ICML
2009
IEEE
16 years 14 days ago
2009
IEEE
We present a large-margin formulation and algorithm for structured output prediction that allows the use of latent variables. Our proposal covers a large range of application prob...