Sciweavers

10997 search results - page 3 / 2200
» On the Structure of Complete Sets
Sort
View
BILDMED
2007
148views Algorithms» more  BILDMED 2007»
13 years 9 months ago
Complete Digital Iconic and Textual Annotation for Mammography
This work aims to propose an interactive method for a iconic and textual annotation of digital mammograms. The suggested annotation tool consists of a semantic network to represent...
Thomas Wittenberg, Matthias Elter, Rüdiger Sc...
LFCS
1992
Springer
13 years 11 months ago
Banishing Robust Turing Completeness
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...
Lane A. Hemachandra, Sanjay Jain, Nikolai K. Veres...
DM
1998
54views more  DM 1998»
13 years 7 months ago
On the structure of a random sum-free set of positive integers
Cameron introduced a natural probability measure on the set S of sum-free sets, and asked which sets of sum-free sets have a positive probability of occurring in this probability m...
Neil J. Calkin
TPHOL
2005
IEEE
14 years 1 months ago
A Structured Set of Higher-Order Problems
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
Christoph Benzmüller, Chad E. Brown
IJCM
2002
97views more  IJCM 2002»
13 years 7 months ago
Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges
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...
Richard Bean, Diane Donovan, Abdollah Khodkar, Ann...