Sciweavers

46 search results - page 2 / 10
» Efficient algorithms for large-scale local triangle counting
Sort
View
AAAI
2008
13 years 7 months ago
Visualization of Large-Scale Weighted Clustered Graph: A Genetic Approach
In this paper, a bottom-up hierarchical genetic algorithm is proposed to visualize clustered data into a planar graph. To achieve global optimization by accelerating local optimiz...
Jiayu Zhou, Youfang Lin, Xi Wang
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 5 months ago
Approximated Structured Prediction for Learning Large Scale Graphical Models
In this paper we propose an approximated structured prediction framework for large scale graphical models and derive message-passing algorithms for learning their parameters effic...
Tamir Hazan, Raquel Urtasun
CEC
2008
IEEE
13 years 11 months ago
Solving large scale global optimization using improved Particle Swarm Optimizer
—As more and more real-world optimization problems become increasingly complex, algorithms with more capable optimizations are also increasing in demand. For solving large scale ...
Sheng-Ta Hsieh, Tsung-Ying Sun, Chan-Cheng Liu, Sh...
KAIS
2011
129views more  KAIS 2011»
13 years 7 days ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
ICCV
2007
IEEE
14 years 7 months ago
Out-of-Core Bundle Adjustment for Large-Scale 3D Reconstruction
Large-scale 3D reconstruction has recently received much attention from the computer vision community. Bundle adjustment is a key component of 3D reconstruction problems. However,...
Kai Ni, Drew Steedly, Frank Dellaert