Sciweavers

1949 search results - page 238 / 390
» Random graphs on surfaces
Sort
View
INFOCOM
2006
IEEE
16 years 2 days ago
Sampling Techniques for Large, Dynamic Graphs
— Peer-to-peer systems are becoming increasingly popular, with millions of simultaneous users and a wide range of applications. Understanding existing systems and devising new pe...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
MICCAI
2010
Springer
15 years 4 months ago
3D Knowledge-Based Segmentation Using Pose-Invariant Higher-Order Graphs
Segmentation is a fundamental problem in medical image analysis. The use of prior knowledge is often considered to address the ill-posedness of the process. Such a process consists...
Chaohui Wang, Olivier Teboul, Fabrice Michel, Salm...
IPMI
2011
Springer
14 years 9 months ago
Fast Brain Matching with Spectral Correspondence
Abstract. Brain matching is an important problem in neuroimaging studies. Current surface-based methods for cortex matching and atlasing, although quite accurate, can require long ...
Herve Lombaert, Leo Grady, Jonathan R. Polimeni, F...
ICDCS
2010
IEEE
15 years 10 months ago
Localized Algorithm for Precise Boundary Detection in 3D Wireless Networks
—This research focuses on distributed and localized algorithms for precise boundary detection in 3D wireless networks. Our objectives are in two folds. First, we aim to identify ...
Hongyu Zhou, Su Xia, Miao Jin, Hongyi Wu
CDC
2008
IEEE
162views Control Systems» more  CDC 2008»
16 years 16 days ago
Average consensus by gossip algorithms with quantized communication
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...
Paolo Frasca, Ruggero Carli, Fabio Fagnani, Sandro...