Sciweavers

5 search results - page 1 / 1
» Goodness in the enumeration and singleton degrees
Sort
View
AML
2010
80views more  AML 2010»
13 years 5 months ago
Goodness in the enumeration and singleton degrees
We investigate and extend the notion of a good approximation with respect to the enumeration (De) and singleton (Ds) degrees. We refine two results by Griffith, on the inversion of...
Charles M. Harris
JSYML
2008
108views more  JSYML 2008»
13 years 5 months ago
Randomness, lowness and degrees
We say that A LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real , oracle B can also find patterns on . In o...
George Barmpalias, Andrew E. M. Lewis, Mariya Ivan...
BMEI
2009
IEEE
13 years 6 months ago
Cell Clumping Quantification and Automatic Area Classification in Peripheral Blood Smear Images
Cell enumeration in peripheral blood smears and cell are widely applied in biological and pathological practice. Not every area in the smear is appropriate for enumeration due to ...
Wei Xiong, S. H. Ong, Christina Kang, Joo-Hwee Lim...
FOIKS
2008
Springer
13 years 6 months ago
SIM-PDT: A Similarity Based Possibilistic Decision Tree Approach
This paper investigates an extension of classification trees to deal with uncertain information where uncertainty is encoded in possibility theory framework. Class labels in data s...
Ilyes Jenhani, Nahla Ben Amor, Salem Benferhat, Zi...
SWAT
2004
Springer
163views Algorithms» more  SWAT 2004»
13 years 10 months ago
New Algorithms for Enumerating All Maximal Cliques
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
Kazuhisa Makino, Takeaki Uno