Sciweavers

9871 search results - page 47 / 1975
» On the Structure of Low Sets
Sort
View
CORR
1999
Springer
65views Education» more  CORR 1999»
13 years 7 months ago
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
Lane A. Hemaspaandra, Jörg Rothe
TITB
2011
217views more  TITB 2011»
13 years 2 months ago
Phase-Based Level Set Segmentation of Ultrasound Images
— Ultrasound images segmentation is a difficult problem due to speckle noise, low contrast and local changes of intensity. Intensity based methods do not perform particularly we...
Ahror Belaid, Djamal Boukerroui, Yves Maingourd, J...
TKDE
2010
184views more  TKDE 2010»
13 years 6 months ago
The Dynamic Bloom Filters
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan L...
RSEISP
2007
Springer
14 years 1 months ago
Interpreting Low and High Order Rules: A Granular Computing Approach
The main objective of this paper is to provide a granular computing based interpretation of rules representing two levels of knowledge. This is done by adopting and adapting the de...
Yiyu Yao, Bing Zhou, Yaohua Chen
ICPR
2000
IEEE
14 years 4 days ago
Constrained Mixture Modeling of Intrinsically Low-Dimensional Distributions
In this paper we introduce a novel way of modeling distributions with a low latent dimensionality. Our method allows for a strict control of the properties of the mapping between ...
Joris Portegies Zwart, Ben J. A. Kröse