Sciweavers

1806 search results - page 244 / 362
» Randomness and halting probabilities
Sort
View
IMC
2010
ACM
15 years 2 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
HIS
2009
15 years 1 months ago
On Some Properties of the lbest Topology in Particle Swarm Optimization
: Particle Swarm Optimization (PSO) is arguably one of the most popular nature- inspired algorithms for real parameter optimization at present. The existing theoretical research on...
Sayan Ghosh, Debarati Kundu, Kaushik Suresh, Swaga...
ALGORITHMICA
2011
14 years 11 months ago
Knowledge State Algorithms
We introduce the concept of knowledge states; many well-known algorithms can be viewed as knowledge state algorithms. The knowledge state approach can be used to to construct comp...
Wolfgang W. Bein, Lawrence L. Larmore, John Noga, ...
MA
2011
Springer
241views Communications» more  MA 2011»
14 years 11 months ago
On the distribution of the ratio of the largest eigenvalue to the trace of a Wishart matrix
The ratio of the largest eigenvalue divided by the trace of a p×p random Wishart matrix with n degrees of freedom and identity covariance matrix plays an important role in variou...
Boaz Nadler
SIAMAM
2011
14 years 11 months ago
Imaging Schemes for Perfectly Conducting Cracks
We consider the problem of locating perfectly conducting cracks and estimating their geometric features from multi-static response matrix measurements at a single or multiple frequ...
Habib Ammari, Josselin Garnier, Hyeonbae Kang, Won...