Sciweavers

1806 search results - page 335 / 362
» Randomness and halting probabilities
Sort
View
ICPR
2008
IEEE
14 years 4 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
PIMRC
2008
IEEE
14 years 4 months ago
Understanding the Performance of 802.11 Networks
Abstract—In this paper, we review the most important performance characteristics of the 802.11 DCF wireless networks, point out some false common knowledge, and report on recent ...
Andrzej Duda
EVOW
2007
Springer
14 years 4 months ago
Overcompressing JPEG Images with Evolution Algorithms
Abstract. Overcompression is the process of post-processing compressed images to gain either further size reduction or improved quality. This is made possible by the fact that the ...
Jacques Lévy Véhel, Franklin Mendivi...
ISAAC
2007
Springer
102views Algorithms» more  ISAAC 2007»
14 years 4 months ago
Depth of Field and Cautious-Greedy Routing in Social Networks
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
David Barbella, George Kachergis, David Liben-Nowe...
ISBRA
2007
Springer
14 years 4 months ago
Reconstruction of 3D Structures from Protein Contact Maps
Proteins are large organic compounds made of amino acids arranged in a linear chain (primary structure). Most proteins fold into unique threedimensional (3D) structures called inte...
Marco Vassura, Luciano Margara, Filippo Medri, Pie...