Sciweavers

3172 search results - page 12 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
CIVR
2005
Springer
102views Image Analysis» more  CIVR 2005»
14 years 3 months ago
A Complete Keypics Experiment with Size Functions
Abstract. Keypics are graphical metadata intended for indexing of images on the Internet. They are conceived as hand-drawn sketches, not restricted to a definite set. An obvious d...
Andrea Cerri, Massimo Ferri, Daniela Giorgi
DM
1998
73views more  DM 1998»
13 years 9 months ago
On constructing snakes in powers of complete graphs
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...
Jerzy Wojciechowski
JAIR
2012
254views Hardware» more  JAIR 2012»
12 years 8 days ago
Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice
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 ...
Bernardo Cuenca Grau, Boris Motik, Giorgos Stoilos...
ICASSP
2010
IEEE
13 years 8 months ago
A novel, fast, and complete 3D segmentation of vertebral bones
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...
Melih S. Aslan, Asem M. Ali, Ham Rara, Ben Arnold,...
GC
2011
Springer
13 years 4 months ago
Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs
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,...
Tao Jiang, Michael Salerno