Sciweavers

1095 search results - page 183 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
HPCC
2005
Springer
15 years 12 months ago
Efficient SIMD Numerical Interpolation
This paper reports the results of SIMD implementation of a number of interpolation algorithms on common personal computers. These methods fit a curve on some given input points for...
Hossein Ahmadi, Maryam Moslemi Naeini, Hamid Sarba...
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
15 years 10 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
FSTTCS
2008
Springer
15 years 7 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
TPDS
2008
80views more  TPDS 2008»
15 years 6 months ago
Scalable and Efficient End-to-End Network Topology Inference
To construct an efficient overlay network, the information of underlay is important. We consider using end-to-end measurement tools such as traceroute to infer the underlay topolog...
Xing Jin, Wanqing Tu, S.-H. Gary Chan
WWW
2009
ACM
16 years 7 months ago
An experimental study of large-scale mobile social network
Mobile social network is a typical social network where one or more individuals of similar interests or commonalities, conversing and connecting with one another using the mobile ...
Zheng-Bin Dong, Guo-Jie Song, Kun-Qing Xie, Jing-Y...