1566 search results - page 106 / 314 » On a Cone Covering Problem |
161
click to vote
LREC
2010
15 years 7 months ago
2010
As the data for more and more languages is finding its way into digital form, with an increasing amount of this data being posted to the Web, it has become possible to collect lan...
132
click to vote
HCI
2001
15 years 7 months ago
2001
: Most current electronic services do not address the breadth of design issues necessary to comply with `design-for-all' concepts, despite the fact that various design-for-all...
182
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
153
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
147
click to vote
COMPSAC
2006
IEEE
16 years 13 days ago
2006
IEEE
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...