Sciweavers

358 search results - page 58 / 72
» On the Distributed Complexity of Computing Maximal Matchings
Sort
View
GCC
2005
Springer
15 years 7 months ago
A Mathematical Foundation for Topology Awareness of P2P Overlay Networks
Abstract. In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying ...
Habib Rostami, Jafar Habibi
121
Voted
CORR
2007
Springer
144views Education» more  CORR 2007»
15 years 1 months ago
Optimization of Information Rate Upper and Lower Bounds for Channels with Memory
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
15 years 6 months ago
Optimal equivalent circuits for interconnect delay calculations using moments
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
Sudhakar Muddu, Andrew B. Kahng
ICCV
2007
IEEE
15 years 5 months ago
Diffusion Maps Segmentation of Magnetic Resonance Q-Ball Imaging
We present a Diffusion Maps clustering method applied to diffusion MRI in order to segment complex white matter fiber bundles. It is well-known that diffusion tensor imaging (DTI)...
Demian Wassermann, Maxime Descoteaux, Rachid Deric...
180
Voted
SDM
2012
SIAM
245views Data Mining» more  SDM 2012»
13 years 4 months ago
Deterministic CUR for Improved Large-Scale Data Analysis: An Empirical Study
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
Christian Thurau, Kristian Kersting, Christian Bau...