Sciweavers

25 search results - page 3 / 5
» Online Maximum Directed Cut
Sort
View
MIAR
2010
IEEE
13 years 4 months ago
DTI Connectivity by Segmentation
Abstract. This paper proposes a new method to compute connectivity information from diffusion weighted images. It is inspired by graphbased approaches to connectivity definition,...
Marc Niethammer, Alexis Boucharin, Christopher Zac...
INFOCOM
2009
IEEE
14 years 27 days ago
Assessing the Vulnerability of the Fiber Infrastructure to Disasters
—Communication networks are vulnerable to natural disasters, such as earthquakes or floods, as well as to physical attacks, such as an Electromagnetic Pulse (EMP) attack. Such r...
Sebastian Neumayer, Gil Zussman, Reuven Cohen, Eyt...
CN
2006
75views more  CN 2006»
13 years 6 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
TIT
2011
149views more  TIT 2011»
13 years 1 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
3DPVT
2004
IEEE
176views Visualization» more  3DPVT 2004»
13 years 10 months ago
3D Model Retrieval Based on 2D Slice Similarity Measurements
In this paper, we present an approach based on 2D slices for measuring similarity between 3D models. The key idea is to represent the 3D model by a series of slices along certain ...
Jiantao Pu, Yi Liu, Guyu Xin, Hongbin Zha, Weibin ...