4066 search results - page 25 / 814 » Almost Complete Sets |
IJCM
2002
13 years 7 months ago
2002
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
LFCS
1992
Springer
13 years 11 months ago
1992
Springer
This paper proves that "promise classes" are so fragilely structured that they do not robustly (i.e. with respect to all oracles) possess Turinghard sets even in classes...
RR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The Semantic Web is commonly perceived as a web of partially interlinked machine readable data. This data is inherently distributed and resembles the structure of the web...
3DPVT
2002
IEEE
14 years 17 days ago
2002
IEEE
3D medical images produced in health centers represent tremendous amounts of data spread over different places. Automatic processing of these data often allow quantitative and rep...
APPROX
2011
Springer
12 years 7 months ago
2011
Springer
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...