Sciweavers

1731 search results - page 33 / 347
» Maximum likelihood analysis of algorithms and data structure...
Sort
View
IOR
2011
175views more  IOR 2011»
14 years 10 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....
145
Voted
CVPR
2000
IEEE
16 years 5 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
140
Voted
ISCI
2008
130views more  ISCI 2008»
15 years 3 months ago
Unified eigen analysis on multivariate Gaussian based estimation of distribution algorithms
Multivariate Gaussian models are widely adopted in continuous Estimation of Distribution Algorithms (EDAs), and covariance matrix plays the essential role in guiding the evolution...
Weishan Dong, Xin Yao
137
Voted
SOCIALCOM
2010
15 years 1 months ago
Estimating the Size of Online Social Networks
The huge size of online social networks (OSNs) makes it prohibitively expensive to precisely measure any properties which require the knowledge of the entire graph. To estimate the...
Shaozhi Ye, Shyhtsun Felix Wu
130
Voted
ICMLA
2008
15 years 5 months ago
Mapping Uncharted Waters: Exploratory Analysis, Visualization, and Clustering of Oceanographic Data
In this paper we describe an interdisciplinary collaboration between researchers in machine learning and oceanography. The collaboration was formed to study the problem of open oc...
Joshua M. Lewis, Pincelli M. Hull, Kilian Q. Weinb...