Sciweavers

95 search results - page 6 / 19
» Truth in generic cuts
Sort
View
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 2 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
ICDAR
2011
IEEE
12 years 7 months ago
A Method of Evaluating Table Segmentation Results Based on a Table Image Ground Truther
—We propose a novel method to evaluate table segmentation results based on a table image ground truther. In the ground-truthing process, we first extract connected components fr...
Yanhui Liang, Yizhou Wang, Eric Saund
IANDC
2010
119views more  IANDC 2010»
13 years 6 months ago
Cut elimination in coalgebraic logics
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
Dirk Pattinson, Lutz Schröder
DATE
2004
IEEE
151views Hardware» more  DATE 2004»
13 years 11 months ago
Boosting: Min-Cut Placement with Improved Signal Delay
In this work we improve top-down min-cut placers in the context of timing closure. Using the concept of boosting factors, we adjust net weights according to net spans, so as to re...
Andrew B. Kahng, Igor L. Markov, Sherief Reda
CIVR
2005
Springer
165views Image Analysis» more  CIVR 2005»
13 years 9 months ago
The Use and Utility of High-Level Semantic Features in Video Retrieval
Abstract. This paper investigates the applicability of high-level semantic features for video retrieval using the benchmarked data from TRECVID 2003 and 2004, addressing the contri...
Michael G. Christel, Alexander G. Hauptmann