4066 search results - page 44 / 814 » Almost Complete Sets |
DM
1998
13 years 9 months ago
1998
We prove the conjecture of Abbott and Katchalski that for every m ≥ 2 there is a positive constant λm such that S(Kd mn) ≥ λmnd−1 S(Kd−1 m ) where S(Kd m) is the length o...
JAIR
2012
12 years 12 days ago
2012
To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at ...
ISER
2000
Springer
2000
Springer
Simulation and Experimental Evaluation of Complete Sensor-Based Coverage in Rectilinear Environments
14 years 1 months ago
: Although sensor-based coverage is a skill which is applicable to a variety of robot tasks, its implementation has so far been limited, mostly by the physical limitations of tradi...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs), especially the trabecular bones (TBs). In this paper...
GC
2011
Springer
13 years 5 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...