Sciweavers

779 search results - page 60 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
GECCO
2010
Springer
194views Optimization» more  GECCO 2010»
15 years 8 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
PRL
2010
188views more  PRL 2010»
15 years 2 months ago
Sparsity preserving discriminant analysis for single training image face recognition
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...
Lishan Qiao, Songcan Chen, Xiaoyang Tan
CDC
2010
IEEE
106views Control Systems» more  CDC 2010»
14 years 11 months ago
Semi-autonomous networks: Network resilience and adaptive trees
This paper examines the dynamics of a networked multi-agent system operating with a consensus-type coordination algorithm that can be influenced by external agents. We refer to thi...
Airlie Chapman, Mehran Mesbahi
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 9 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
APWEB
2010
Springer
15 years 9 months ago
Crawling Online Social Graphs
—Extensive research has been conducted on top of online social networks (OSNs), while little attention has been paid to the data collection process. Due to the large scale of OSN...
Shaozhi Ye, Juan Lang, Shyhtsun Felix Wu