Sciweavers

1722 search results - page 137 / 345
» On the sample mean of graphs
Sort
View
SOCIALCOM
2010
15 years 4 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
GECCO
2010
Springer
194views Optimization» more  GECCO 2010»
15 years 10 months ago
Mirrored variants of the (1, 2)-CMA-ES compared on the noisy BBOB-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ) and (1 + 2) Evolution-Strategies (ESs) with the aim of designing f...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
ACSD
1998
IEEE
105views Hardware» more  ACSD 1998»
15 years 10 months ago
Visual Formalisms Revisited
The development of an interactive application is a complex task that has to consider data, behavior, intercommunication, architecture and distribution aspects of the modeled syste...
Radu Grosu, Gheorghe Stefanescu, Manfred Broy
ICDE
2008
IEEE
203views Database» more  ICDE 2008»
16 years 7 months ago
Training Linear Discriminant Analysis in Linear Time
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
Deng Cai, Xiaofei He, Jiawei Han
AINA
2003
IEEE
15 years 11 months ago
Detection of Multiple Bottleneck Bandwidth
This paper endeavors to present a scheme to detect and estimate bottleneck bandwidth along the path in the Internet. We have participated in the RIPE NCC’s TTM project to perfor...
Niwat Thepvilojanapong, Yoshito Tobe, Kaoru Sezaki