Sciweavers

1414 search results - page 54 / 283
» Cover Time and Broadcast Time
Sort
View
PR
2007
100views more  PR 2007»
13 years 9 months ago
Estimation of skew angles for scanned documents based on piecewise covering by parallelograms
We propose a fast and robust skew estimation method for scanned documents that estimates skew angles based on piecewise covering of objects, such as textlines, figures, forms, or...
Chien-Hsing Chou, Shih-Yu Chu, Fu Chang
WORDS
2005
IEEE
14 years 3 months ago
Progressive Ranking and Composition of Web Services Using Covering Arrays
Major computer companies and government agencies are adopting Web Services (WS) technology. Web services must ensure interoperability and security, and be reliable and trustworthy...
Charles J. Colbourn, Yinong Chen, Wei-Tek Tsai
QSIC
2003
IEEE
14 years 3 months ago
Generating Small Combinatorial Test Suites to Cover Input-Output Relationships
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...
Christine Cheng, Adrian Dumitrescu, Patrick J. Sch...
MST
2010
117views more  MST 2010»
13 years 8 months ago
Class Constrained Bin Covering
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
Leah Epstein, Csanád Imreh, Asaf Levin
TCS
2010
13 years 8 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer