Sciweavers

9209 search results - page 212 / 1842
» Data Space Randomization
Sort
View
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 6 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
PAA
2002
15 years 5 months ago
Bagging, Boosting and the Random Subspace Method for Linear Classifiers
: Recently bagging, boosting and the random subspace method have become popular combining techniques for improving weak classifiers. These techniques are designed for, and usually ...
Marina Skurichina, Robert P. W. Duin
ICMCS
2009
IEEE
415views Multimedia» more  ICMCS 2009»
15 years 4 months ago
A new localized superpixel Markov random field for image segmentation
In this paper, we present a novel localized Markov random field (MRF) method based on superpixels for region segmentation. Early vision problems could be formulated as pixel label...
Xiaofeng Wang, Xiao-Ping Zhang
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 6 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
IPMI
2005
Springer
15 years 11 months ago
PET Image Reconstruction: A Robust State Space Approach
Statistical iterative reconstruction algorithms have shown improved image quality over conventional nonstatistical methods in PET by using accurate system response models and measu...
Huafeng Liu, Yi Tian, Pengcheng Shi