Sciweavers

102 search results - page 16 / 21
» Balanced Paths in Colored Graphs
Sort
View
HPCC
2007
Springer
14 years 1 months ago
CDACAN: A Scalable Structured P2P Network Based on Continuous Discrete Approach and CAN
Abstract. CAN is a famous structured peer-to-peer network based on ddimensional torus topology with constant degree and logarithmical diameter, but suffers from poor scalability wh...
Lingwei Li, Qunwei Xue, Deke Guo
ICIP
2009
IEEE
14 years 8 months ago
Improved Global Cardiac Tractography With Simulated Annealing
We propose a new fibre tracking algorithm for cardiac DTMRI that parts with the locally "greedy" paradigm intrinsic to conventional tracking algorithms. We formulate the...
INFOCOM
1993
IEEE
13 years 12 months ago
Power-Optimal Layout of Passive, Single-Hop, Fiber-Optic Interconnections Whose Capacity Increases with the Number of Stations
Passive, single-hop interconnections among N stations, each with several transmitters and receivers, provide a communication path between any two stations using one of the transmi...
Yitzhak Birk
CVPR
2010
IEEE
14 years 4 months ago
Geodesic Graph Cut for Interactive Image Segmentation
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seed...
Brian Price, Bryan Morse, Scott Cohen
RECOMB
2007
Springer
14 years 8 months ago
QNet: A Tool for Querying Protein Interaction Networks
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
Banu Dost, Tomer Shlomi, Nitin Gupta 0002, Eytan R...